Pages that link to "Item:Q985374"
From MaRDI portal
The following pages link to Gröbner bases and combinatorics for binary codes (Q985374):
Displaying 19 items.
- On the ideal associated to a linear code (Q326292) (← links)
- Computing Gröbner bases associated with lattices (Q340181) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- Binomial coefficient codes over GF(2) (Q1199598) (← links)
- Gröbner bases of certain zero-dimensional ideals arising in coding theory (Q1415386) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← 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)
- Groebner bases for quaternary codes (Q2879674) (← links)
- Gröbner Bases Methods in Coding Theory (Q2977867) (← links)
- On the Fan Associated to a Linear Code (Q3460459) (← links)
- (Q4276340) (← links)
- (Q4394955) (← links)
- Trial Set and Gröbner Bases for Binary Codes (Q4609995) (← links)
- Algebraic Modelling of Covering Arrays (Q4610003) (← links)
- Computing coset leaders and leader codewords of binary codes (Q5255749) (← links)
- Linear label code of a root lattice using Gröbner bases (Q6139276) (← links)