Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
From MaRDI portal
Publication:3483231
Recommendations
- Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
- scientific article; zbMATH DE number 45704
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
- scientific article; zbMATH DE number 691462
Cited in
(9)- Error-locating pairs for cyclic codes
- Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
- Decoding binary two-error correcting cyclic codes with Zech logarithms
- scientific article; zbMATH DE number 45704 (Why is no real title available?)
- Quadratic-residue codes and cyclotomic fields
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
- Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound
- On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
- On algebraic decoding of cyclic codes
This page was built for publication: Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483231)
