A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes

DOI10.1109/18.119712zbMath0744.94015OpenAlexW2112850302MaRDI QIDQ3990790

Arne Dür

Publication date: 28 June 1992

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

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

zbMATH Keywords

cyclic codeinvariant theorylinear complexityBerlekamp-Massey algorithmburst-correcting limit

Mathematics Subject Classification ID

Cyclic codes (94B15) Burst-correcting codes (94B20)

Related Items (1)

GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES

This page was built for publication: A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes