Calculating the minimum distance of a toric code via algebraic algorithms
DOI10.1007/s11786-023-00566-7OpenAlexW4385331917MaRDI QIDQ6178862
Publication date: 5 September 2023
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-023-00566-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- The parameters of projective Reed-Müller codes
- Toric codes and lattice ideals
- Small polygons and toric codes
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- Algebraic geometric codes on minimal Hirzebruch surfaces
- Remarks on generalized toric codes
- Uniform bounds on multigraded regularity
- Projective toric codes
- Toric Surfaces, Linear and Quantum Codes: Secret Sharing and Decoding
- Lattice Ideals, Semigroups and Toric Codes
- Seven new champion linear codes
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Algebraic geometry and commutative algebra
- On parameterized toric codes
- Unnamed Item
This page was built for publication: Calculating the minimum distance of a toric code via algebraic algorithms
