A new procedure for decoding cyclic and BCH codes up to actual minimum distance

DOI10.1109/18.333854zbMath0813.94015OpenAlexW2143563373MaRDI QIDQ4324108

No author found.

Publication date: 1 March 1995

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

Full work available at URL: https://semanticscholar.org/paper/73ade0898239bb8029aea0468d6b0abece8c41f6

zbMATH Keywords

complexityBCH codesdecodingcyclic codingPeterson decoding procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

A symmetric Roos bound for linear codes ⋮ Decoding the ternary \((23, 11, 9)\) quadratic residue code ⋮ Algebraic decoding of the \((41, 21, 9)\) quadratic residue code

This page was built for publication: A new procedure for decoding cyclic and BCH codes up to actual minimum distance