Gröbner bases methods in coding theory
From MaRDI portal
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)
Recommendations
Cited in
(16)- Gröbner bases of certain zero-dimensional ideals arising in coding theory
- On evaluation codes coming from a tower of function fields
- Bounding the minimum distance of affine variety codes using symbolic computations of footprints
- On affine variety codes from the Klein quartic
- scientific article; zbMATH DE number 5863220 (Why is no real title available?)
- Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art
- scientific article; zbMATH DE number 493097 (Why is no real title available?)
- scientific article; zbMATH DE number 1163423 (Why is no real title available?)
- scientific article; zbMATH DE number 1756454 (Why is no real title available?)
- scientific article; zbMATH DE number 2222667 (Why is no real title available?)
- On generalized monomial codes defined over sets with a special vanishing ideal
- Decreasing norm-trace codes
- On the number of minimal and next-to-minimal weight codewords of toric codes over hypersimplices
- Next-to-minimal weight of toric codes defined over hypersimplices
- Almost covers of finite sets of points
- On the next-to-minimal weight of affine Cartesian codes
This page was built for publication: Gröbner bases methods in coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977867)
