English
Related papers

Related papers: Schur ring and Codes for $S$-subgroups over $\Z_{2…

200 papers

In this paper a variety of issues are discussed, Schur ring, $S$-sets, circulant orbits, decimation operator and Hadamard matrices and their relation between them is shown. Firstly we define the complete $S$-sets. Next, we study the…

Combinatorics · Mathematics 2019-04-12 Ronald Orozco López

A Z2-triple cyclic code of block length (r,s,t) is a binary code of length r+s+t such that the code is partitioned into three parts of lengthsr,s andt such that each of the three parts is invariant under the cyclic shifts of the…

Information Theory · Computer Science 2019-06-05 B. Srinivasulu

Let $R=\mathbb{Z}_4$ be the integer ring mod $4$. A double cyclic code of length $(r,s)$ over $R$ is a set that can be partitioned into two parts that any cyclic shift of the coordinates of both parts leaves invariant the code. These codes…

Information Theory · Computer Science 2015-01-08 Jian Gao , Minjia Shi , Tingting Wu , Fang-Wei Fu

A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…

Information Theory · Computer Science 2014-10-22 Joaquim Borges , Cristina Fernández-Córdoba , Roger Ten-Valls

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab

Let $A$ and $B$ be subsets of a finite group $G$ and $r$ a positive integer. If for every $g\in G$, there are precisely $r$ pairs $(a,b)\in A\times B$ such that $g=ab$, then $B$ is called a code in $G$ with respect to $A$ and we write $r…

Combinatorics · Mathematics 2025-12-23 Teng Fang , Jinbao Li

A Schur ring (S-ring) over a group $G$ is called separable if every of its similaritities is induced by isomorphism. We establish a criterion for an S-ring to be separable in the case when the group $G$ is cyclic. Using this criterion, we…

Group Theory · Mathematics 2017-06-21 Sergei Evdokimov , Ilya Ponomarenko

We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…

Information Theory · Computer Science 2007-11-01 Paul Hurley , Ted Hurley

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

We study $\Theta_S-$cyclic codes over the family of rings $A_k.$ We characterize $\Theta_S-$cyclic codes in terms of their binary images. A family of Hermitian inner-products is defined and we prove that if a code is $\Theta_S-$cyclic then…

The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary $n^2 \times n^2$ S-permutation matrix, a lower band of the number of all disjoint with it S-permutation…

Combinatorics · Mathematics 2014-04-28 Krasimir Yordzhev

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^{\alpha}-1\rangle \times…

Information Theory · Computer Science 2022-02-24 Cristina Fernández-Córdoba , Sachin Pathak , Ashish Kumar Upadhyay

This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…

Group Theory · Mathematics 2020-11-18 Meral Süer , Mehmet Yeşil

Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is…

Information Theory · Computer Science 2015-04-28 Jian Gao , Fang-Wei Fu , Ling Xiao , Rama Krishna Bandi

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

Let $G$ be a finite group. If $\Gamma$ is a permutation group with $G_{right}\leq\Gamma\leq Sym(G)$ and $\mathcal{S}$ is the set of orbits of the stabilizer of the identity $e=e_{G}$ in $\Gamma$, then the $\mathbb{Z}$-submodule…

Group Theory · Mathematics 2017-09-15 Grigory Ryabov

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…

Information Theory · Computer Science 2012-02-01 Adel Alahmadi , Patrick Solé , Houda Sboui , Olfa Yemen

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Information Theory · Computer Science 2019-04-16 Irwansyah , Intan Muchtadi-Alamsyah , Aleams Barra
‹ Prev 1 2 3 10 Next ›