Pages that link to "Item:Q4324145"

The following pages link to Use of Grobner bases to decode binary cyclic codes up to the true minimum distance (Q4324145):

Displaying 13 items.

• Matrix-product structure of repeated-root cyclic codes over finite fields (Q268495) (← links)
• Correcting errors and erasures via the syndrome variety (Q557068) (← links)
• On the decoding of the \((24, 12, 8)\) Golay code (Q621601) (← links)
• Improved decoding of affine-variety codes (Q714109) (← links)
• On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
• Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
• HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
• On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
• Degröbnerization: a political manifesto (Q2100110) (← links)
• A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code (Q2390373) (← links)
• Reed‐muller codes: an ideal theory approach (Q3124345) (← links)
• GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES (Q3595326) (← links)
• Towards a Gröbner-free approach to coding (Q6146596) (← links)