Decoding cyclic codes by using Dixon resultant method
From MaRDI portal
Recommendations
- General principles for the algebraic decoding of cyclic codes
- On the decoding of cyclic codes using Gröbner bases
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- 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>
- On the decoding of binary cyclic codes with the Newton identities
This page was built for publication: Decoding cyclic codes by using Dixon resultant method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886638)
