Repeated-root constacyclic codes of prime power lengths over finite chain rings
From MaRDI portal
Publication:346276
DOI10.1016/j.ffa.2016.07.011zbMath1351.94086OpenAlexW2525394757MaRDI QIDQ346276
Songsak Sriboonchitta, Hien D. T. Nguyen, Thang M. Vo, Hai Quang Dinh
Publication date: 5 December 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2016.07.011
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items
Roulette games and depths of words over finite commutative rings, Self-dual constacyclic codes of length \(2^s\) over the ring \(\mathbb{F}_{2^m}[u,v/\langle u^2, v^2, uv-vu \rangle \)], Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m), Unnamed Item, On constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v \slash \langle u^2 , v^2 , u v - v u \rangle \)], On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\), On the classification of ideals over \(R[X/\langle f(X)^{p^s}\rangle\) when \(R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+\cdots+u^n\mathbb{F}_{p^m}\)], Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\), Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\), LCP of constacyclic codes over finite chain rings, MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\), Symbol-triple distance of repeated-root constacyclic codes of prime power lengths, Self-reciprocal and self-conjugate-reciprocal irreducible factors of \(x^n - \lambda\) and their applications, REPEATED-ROOT CONSTACYCLIC CODES OVER F3+uF3+uvF3, Explicit constructions of cyclic and negacyclic codes of length 3ps over đ˝pm + uđ˝pm, Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes, Construction of optimal codes from a class of constacyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals]
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Finite Hjelmslev planes
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- On the structure of linear and cyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- On constacyclic codes over finite chain rings
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- On the algebraic structure of quasi-cyclic codes. IV: Repeated roots
- Cyclic codes over \(\mathbb Z_4\) of even length
- Kerdock code in a cyclic form
- A Mass Formula and Rank of<tex>$BBZ_4$</tex>Cyclic Codes of Length<tex>$2^e$</tex>
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Semisimple cyclic and Abelian codes. II
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Hamming metric decoding of alternant codes over Galois rings
- Decoding a class of Lee metric codes over a Galois ring
- Negacyclic codes over Z/sub 4/ of even length
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
