Pages that link to "Item:Q3548088"
From MaRDI portal
The following pages link to General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula> (Q3548088):
Displaying 17 items.
- Correcting errors and erasures via the syndrome variety (Q557068) (← links)
- Improved decoding of affine-variety codes (Q714109) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Generalized threshold decoding of cyclic codes (Q1068056) (← links)
- Decoding of Berman modular MDS codes (Q1117201) (← links)
- On algebraic decoding of cyclic codes (Q1567726) (← links)
- On the decoding of Preparata codes (Q1569279) (← links)
- Structure prediction for error pattern and extension of Welch-Berlekamp theorem (Q1909421) (← links)
- Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial (Q2043988) (← links)
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code (Q2863727) (← links)
- Decoding cyclic codes by using Dixon resultant method (Q2886638) (← links)
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES (Q3595326) (← links)
- Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound (Q3986484) (← links)
- On error-and-erasure decoding of cyclic codes (Q3990787) (← links)
- Five infinite families of binary cyclic codes and their related codes with good parameters (Q6136718) (← links)
