Gröbner bases for codes
From MaRDI portal
Recommendations
Cited in
(20)- Gröbner bases of certain zero-dimensional ideals arising in coding theory
- Gröbner bases and distance of cyclic codes
- Generalized star configurations and the Tutte polynomial
- On ideals generated by a-fold products of linear forms
- Steiner systems and configurations of points
- scientific article; zbMATH DE number 5885942 (Why is no real title available?)
- scientific article; zbMATH DE number 5863220 (Why is no real title available?)
- On the Geramita-Harbourne-Migliore conjecture
- Fast computation of a rational point of a variety over a finite field
- Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art
- scientific article; zbMATH DE number 4010390 (Why is no real title available?)
- scientific article; zbMATH DE number 493097 (Why is no real title available?)
- scientific article; zbMATH DE number 1163423 (Why is no real title available?)
- On the small-weight codewords of some Hermitian codes
- Error-correction of linear codes via colon ideals
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- Generalized Hamming weights and minimal shifts of Orlik-Terao algebras
- On the decoding of binary cyclic codes with the Newton identities
- Minimum distance of linear codes and the -invariant
- On the De Boer-Pellikaan method for computing minimum distance
This page was built for publication: Gröbner bases for codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238966)