The following pages link to (Q4242014):
Displayed 23 items.
- On the ideal associated to a linear code (Q326292) (← links)
- Error-correction of linear codes via colon ideals (Q497727) (← 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)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- LDPC codes from Singer cycles (Q1026131) (← links)
- On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139) (← links)
- On the weak order ideal associated to linear codes (Q1616169) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Linear codes with complementary duals meet the Gilbert-Varshamov bound (Q1877682) (← links)
- Comments on ``Integer SEC-DED codes for low power communications'' (Q1944911) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- Hamming codes for wet paper steganography (Q2350929) (← links)
- Asymptotic behaviour of codes in rank metric over finite fields (Q2439748) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- McEliece Cryptosystem Implementation: Theory and Practice (Q3535350) (← links)
- On a Gröbner bases structure associated to linear codes (Q3637823) (← links)
- Trial Set and Gröbner Bases for Binary Codes (Q4609995) (← links)
- Diagnosis of Partially Observed Petri Net Based on Analytical Redundancy Relationships (Q5213917) (← links)