Results 31 to 40 of about 305,381 (270)
Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes
Mathematics, 2023 We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes.
Adel Alahmadi +2 more
doaj +1 more source
Indecomposability of cyclic codes
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Kashiwagi, Isao Kikumasa
openaire +1 more source
Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2021 Lemma 26 has been rewritten with respect to the previous ...
openaire +2 more sources
Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code
Tongxin xuebao, 2008 Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code ...
ZHANG Guo-hua, WANG Xin-mei
doaj +2 more sources
Rank equivalent and rank degenerate skew cyclic codes
, 2016 Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing
Martínez-Peñas, Umberto
core +1 more source
Constructions of cyclic codes and extended primitive cyclic codes with their applications
Finite Fields and Their Applications, 2023 Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on special polynomials over finite fields.
Ziling Heng, Xinran Wang, Xiaoru Li
openaire +3 more sources
Z2Z4-additive cyclic codes, generator polynomials and dual codes
, 2016 A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of ${\mathbb{Z}}_4 ...
Borges, Joaquim +2 more
core +2 more sources
How to Generate Cyclically Permutable Codes From Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2006 On the basis of the characteristics of cyclic codes, the codeword space can be partitioned into small subspaces where cyclically shifted codewords of a particular codeword occupy the same subspace. A cyclically permutable code generates codewords belonging to each subspace.
Minoru Kuribayashi, Hatsukazu Tanaka
openaire +1 more source
Constructions of Orbit Codes Based on Unitary Spaces Over Finite Fields
IEEE Access, 2021 Orbit codes, as special constant dimension codes, have attracted much attention due to their applications for error correction in random network coding. This paper is devoted to constructing large orbit codes by making full use of unitary space. Firstly,
Shangdi Chen, Qin Xu
doaj +1 more source
Cyclic, LCD, and Self-Dual Codes over the Non-Frobenius Ring GR(p2,m)[u]/〈u2,pu〉
MathematicsLet p be a prime number and m be a positive integer. In this paper, we investigate cyclic codes of length n over the local non-Frobenius ring R=GR(p2,m)[u], where u2=0 and pu=0.
Sami Alabiad, Alhanouf Ali Alhomaidhi
doaj +1 more source