Pages that link to "Item:Q1392662"
From MaRDI portal
The following pages link to On the decoding of cyclic codes using Gröbner bases (Q1392662):
Displaying 25 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)
- 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)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- Description of minimum weight codewords of cyclic codes by algebraic systems (Q1383493) (← links)
- On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
- Gröbner bases and distance of cyclic codes (Q1606071) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- Gröbner basis for norm-trace codes (Q1760099) (← links)
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem (Q1871799) (← links)
- Degröbnerization: a political manifesto (Q2100110) (← links)
- Algebraic structure of the minimal support codewords set of some linear codes (Q2275876) (← links)
- Information sets in abelian codes: defining sets and Groebner basis (Q2436565) (← links)
- Algebraic description and construction of error-correcting codes: a linear systems point of view (Q2718720) (← 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)
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance (Q4324145) (← links)
- Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction (Q5032568) (← links)
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes (Q5088387) (← links)
- A decoding algorithm for binary linear codes using Groebner bases (Q5383374) (← links)
- Gröbner bases over Galois rings with an application to decoding alternant codes (Q5938546) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)