Pages that link to "Item:Q5383374"
From MaRDI portal
The following pages link to A decoding algorithm for binary linear codes using Groebner bases (Q5383374):
Displaying 14 items.
- On the ideal associated to a linear code (Q326292) (← links)
- Error-correction of linear codes via colon ideals (Q497727) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- Algebraic structure of the minimal support codewords set of some linear codes (Q2275876) (← links)
- Heuristic decoding of linear codes using commutative algebra (Q2350923) (← links)
- An application of the FGLM techniques to linear codes (Q2771347) (← links)
- Groebner bases for quaternary codes (Q2879674) (← links)
- Coset decomposition method for decoding linear codes (Q2911150) (← links)
- A Semigroup Approach to Complete Decoding (Q2977866) (← links)
- Computing coset leaders and leader codewords of binary codes (Q5255749) (← links)
- (Q5701485) (← links)