Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations

DOI10.1109/18.104340zbMath0742.94020OpenAlexW1970481743MaRDI QIDQ3987474

No author found.

Publication date: 28 June 1992

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

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

zbMATH Keywords

minimum distance boundsEuclidean algorithmBerlekamp-Massey algorithmerror-locator polynomialerror-correcting capabilityBCH codingcyclic codingdecoding capabilities of algebraic algorithmsdecoding up to actual minimum distancegeneralization of Peterson's procedurenonrecurrent syndrome dependence relationsPeterson decoding procedure

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (5)

New developments in \(q\)-polynomial codes ⋮ A symmetric Roos bound for linear codes ⋮ On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ On decoding by error location and dependent sets of error positions

This page was built for publication: Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations