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

DOI10.1109/18.104340MaRDI QIDQ3987474zbMATH OpenOpenAlexFDO

Authors

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

Euclidean algorithmBerlekamp-Massey algorithmminimum distance boundserror-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)

Recommendations

• A new procedure for decoding cyclic and BCH codes up to actual minimum distance
• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
• General principles for the algebraic decoding of cyclic codes
• scientific article; zbMATH DE number 953227

Cited in

(13)

• A symmetric Roos bound for linear codes
• A new procedure for decoding cyclic and BCH codes up to actual minimum distance
• New developments in \(q\)-polynomial codes
• On decoding by error location and dependent sets of error positions
• A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
• On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
• Malfunction in the Peterson-Gorenstein-Zierler decoder
• Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
• Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
• The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987474)