On the distances of cyclic codes of length 2e over Z₄
On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z 4\)
Cyclic codes of length \(2^e\) over \(\mathbb{Z}_4\) are precisely the ideals of the local ring \(\mathbb{Z}_4[X]/(X^{2^e}-1)\); their structure was determined by \textit{T. Abualrub} and \textit{R. Oehmke} (see for instance [Discrete Appl. Math. 128, No. 1, 3--9 (2003; Zbl 1025.94022)] or the article by \textit{S. Dougherty} and \textit{S. Ling} [Des. Codes Cryptography 39, No. 2, 127--153 (2006; Zbl 1172.94637)]). Using these results, the authors investigate the Hamming and the Lee distances of such codes; they give a complete list of the distances with exact results in nearly all 23 cases; exceptions are the Lee distances of three cases for which upper and lower bounds are given.
- Cyclic codes of length 2e over Z₄.
- Cyclic codes over \(Z_4\) of oddly even length
- A Mass Formula and Rank of<tex>$BBZ_4$</tex>Cyclic Codes of Length<tex>$2^e$</tex>
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- The Hamming distances of negacyclic codes of length 2s over GR (2a , m )
- Codes over certain rings
- Codes over integer residue rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Cyclic codes over finite rings
- Cyclic codes over the integers modulo p^m.
- scientific article; zbMATH DE number 1142361 (Why is no real title available?)
- Lee metric codes over integer residue rings (Corresp.)
- Modular and \(p\)-adic cyclic codes
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- On the Hamming distance of linear codes over a finite chain ring
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A mass formula for cyclic codes over Galois rings of characteristic \(p^3\)
- Cyclic codes of length 2e over Z₄.
- Lee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Repeated-root constacyclic codes of length \(6lp^s\)
- The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
- On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length
- Lee distance distribution of repeated-root constacyclic codes over \(\mathrm{GR}(2^e,m)\) and related MDS codes
- Repeated-root constacyclic codes of length 3 ^m p^s
- Repeated-root constacyclic codes of length k p^s
- Repeated-root constacyclic codes of length \(n l p^s\)
- Lee weights of cyclic self-dual codes over Galois rings of characteristic \(p^2\)
- Repeated-root constacyclic codes of length 3lp^s and their dual codes
- 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/
- Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
- Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
- New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length 2rp^s
- The Hamming distances of repeated-root cyclic codes of length 5 p^s
This page was built for publication: On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045137)
