An analogue of the ℤ4-Goethals code in non-primitive length - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Systems Science and Complexity Année : 2017

An analogue of the ℤ4-Goethals code in non-primitive length

Résumé

This paper constructs a cyclic ℤ4-code with a parity-check matrix similar to that of Goethals code but in length 2m + 1, for all m ≥ 4. This code is a subcode of the lifted Zetterberg code for m even. Its minimum Lee weight is shown to be at least 10, in general, and exactly 12 in lengths 33, 65. The authors give an algebraic decoding algorithm which corrects five errors in these lengths for m = 5, 6 and four errors for m > 6.
Fichier non déposé

Dates et versions

hal-04089112 , version 1 (05-05-2023)

Identifiants

Citer

Adel Alahmadi, Husain Alhazmi, Shakir Ali, Tor Helleseth, Rola Hijazi, et al.. An analogue of the ℤ4-Goethals code in non-primitive length. Journal of Systems Science and Complexity, 2017, 30 (4), pp.950-966. ⟨10.1007/s11424-017-5244-3⟩. ⟨hal-04089112⟩
1 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More