Class of shortened cyclic codes over GF(28) for byte-oriented systems

DOI10.1049/EL:19900284MaRDI QIDQ3358648zbMATH OpenOpenAlexFDO

Authors Vijay K. Bhargava, Gérald E. Séguin, P. E. Allard

Publication date 1990

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19900284

zbMATH Keywords

burst errorscyclic codesdecodingrandom errors

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• On cyclic and negacyclic codes of length 8ℓmpn over finite field
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Cyclic Codes Over Gf(4) and Gf(2)
• New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8
• Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region
• scientific article; zbMATH DE number 2192095
• \(\mathbb Z_2\mathbb Z_4\mathbb Z_8\)-cyclic codes
• New quasi-cyclic degenerate linear codes over GF(8)
• Cyclic codes of length \(2^m\)
• Binary cyclic codes from trinomials over GF(2ᵐ)

Cited in

(3)

• Determination of best shortened linear codes
• A Class of High Rate Codes for Byte-Oriented Information Systems
• Byte protecting perfect burst code

This page was built for publication: Class of shortened cyclic codes over GF(28) for byte-oriented systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358648)