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

DOI10.1109/18.2645zbMath0652.94017OpenAlexW2055594945MaRDI QIDQ3798596

Khaled A. S. 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

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

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