Decoding Cyclic Codes up to a New Bound on the Minimum Distance
From MaRDI portal
Publication:5271924
DOI10.1109/TIT.2012.2185924zbMath1365.94609OpenAlexW2096641276MaRDI QIDQ5271924
Antonia Wachter-Zeh, Alexander Zeh, Sergei V. Bezzateev
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2012.2185924
Related Items (4)
Cyclic Generalized Separable (L, G) Codes ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ On some bounds on the minimum distance of cyclic codes over finite fields ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
This page was built for publication: Decoding Cyclic Codes up to a New Bound on the Minimum Distance