Error-locating pairs for cyclic codes
From MaRDI portal
Recommendations
- 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>
- Power error locating pairs
- Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
- On the existence of error-correcting pairs
- scientific article; zbMATH DE number 417878
Cited in
(20)- On the existence of error-correcting pairs
- Squares of matrix-product codes
- Rank error-correcting pairs
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- A characterization of MDS codes that have an error correcting pair
- 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>
- Capability of the error-trapping technique in decoding cyclic codes
- Systems of MDS codes from units and idempotents
- Cyclically permutable error-correcting codes
- Reed-Muller Codes
- The error-correcting pair for TGRS codes
- The properties and the error-correcting pair for lengthened GRS codes
- On the error-correcting pair for MDS linear codes with even minimum distance
- A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes
- The error-correcting pair for direct sum codes
- An improvement for error-correcting pairs of some special MDS codes
- Algebraic decoding of the (41, 21, 9) quadratic residue code
- Testing tensor products of algebraic codes
- Power error locating pairs
- A symmetric Roos bound for linear codes
This page was built for publication: Error-locating pairs for cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324171)
