Calculating the minimum distance of a toric code via algebraic algorithms
From MaRDI portal
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Applications to coding theory and cryptography of arithmetic geometry (14G50) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Recommendations
Cites work
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- Algebraic geometric codes on minimal Hirzebruch surfaces
- Algebraic geometry and commutative algebra
- Lattice ideals, semigroups and toric codes
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- On parameterized toric codes
- Projective toric codes
- Remarks on generalized toric codes
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Seven new champion linear codes
- Small polygons and toric codes
- The parameters of projective Reed-Müller codes
- Toric codes and lattice ideals
- Toric surfaces, linear and quantum codes: secret sharing and decoding
- Toric varieties
- Uniform bounds on multigraded regularity
This page was built for publication: Calculating the minimum distance of a toric code via algebraic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178862)