An Analogue of the Z4-Goethals Code in Non-Primitive Length

ALAHMADI Adel,ALHAZMI Husain,ALI Shakir,HELLESETH Tor,HIJAZI Rola,LI Chunlei,SOL′E Patrick

Journal of Systems Science & Complexity ›› 2017, Vol. 30 ›› Issue (4) : 950-966.

PDF(225 KB)
PDF(225 KB)
Journal of Systems Science & Complexity ›› 2017, Vol. 30 ›› Issue (4) : 950-966. DOI: 10.1007/s11424-017-5244-3

An Analogue of the Z4-Goethals Code in Non-Primitive Length

  • ALAHMADI Adel 1 , ALHAZMI Husain1 , ALI Shakir2 , HELLESETH Tor 3,HIJAZI Rola4 , LI Chunlei5 , SOL´E Patrick6
Author information +
History +

Abstract

This paper constructs a cyclic Z4-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.

Cite this article

Download Citations
ALAHMADI Adel , ALHAZMI Husain , ALI Shakir , HELLESETH Tor , HIJAZI Rola , LI Chunlei , SOL′E Patrick. An Analogue of the Z4-Goethals Code in Non-Primitive Length. Journal of Systems Science and Complexity, 2017, 30(4): 950-966 https://doi.org/10.1007/s11424-017-5244-3
PDF(225 KB)

45

Accesses

0

Citation

Detail

Sections
Recommended

/