On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\) (Q1045137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5648167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\) |
scientific article; zbMATH DE number 5648167 |
Statements
On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\) (English)
0 references
15 December 2009
0 references
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.
0 references
cyclic codes
0 references
quaterny codes
0 references
Hamming distances
0 references
Lee distances
0 references
codes over rings
0 references
0.8541263937950134
0 references
0.8532933592796326
0 references
0.818420946598053
0 references
0.8180648684501648
0 references
0.8172925114631653
0 references