On the existence of optimum cyclic burst correcting codes over GF(q)

DOI10.1109/18.2645MaRDI QIDQ3798596zbMATH OpenOpenAlexFDO

Authors Khaled Abdel-Ghaffar

Publication date 1988

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.2645

zbMATH Keywords

lengthredundancysquare-free polynomialcyclic b-burst correcting code

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Recommendations

• On the existence of optimum cyclic burst- correcting codes
• scientific article; zbMATH DE number 1189045
• scientific article; zbMATH DE number 3295906
• Two observations concerning optimum cyclic burst-correcting codes
• (1, 2) Optimal codes over GF(5)

Cited in

(7)

• scientific article; zbMATH DE number 1189045 (Why is no real title available?)
• scientific article; zbMATH DE number 5912432 (Why is no real title available?)
• Repeated Burst Error Correcting Linear Codes Over GF(q); q = 3
• On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes
• On the existence of optimum cyclic burst- correcting codes
• A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes
• Two observations concerning optimum cyclic burst-correcting codes

This page was built for publication: On the existence of optimum cyclic burst correcting codes over GF(q)

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