Locally recoverable \(J\)-affine variety codes
DOI10.1016/j.ffa.2020.101661zbMath1453.94157arXiv1911.07485OpenAlexW3011791337MaRDI QIDQ1987102
Fernando Hernando, Carlos Munuera, Carlos Galindo Pastor
Publication date: 9 April 2020
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07485
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Affine geometry (14R99)
Uses Software
Cites Work
- Unnamed Item
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- The Magma algebra system. I: The user language
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Quantum codes from affine variety codes and their subfield-subcodes
- On the distance of stabilizer quantum codes from \(J\)-affine variety codes
- Repair Locality With Multiple Erasure Tolerance
- On the Locality of Codeword Symbols
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- New Binary and Ternary LCD Codes
- Classical and Quantum Evaluation Codes at the Trace Roots
- How Long Can Optimal Locally Repairable Codes Be?
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
This page was built for publication: Locally recoverable \(J\)-affine variety codes
