Locally recoverable codes from algebraic curves with separated variables
DOI10.3934/amc.2020019zbMath1442.94062arXiv1806.02681OpenAlexW2972147755WikidataQ127241189 ScholiaQ127241189MaRDI QIDQ2176292
Carlos Munuera, Fernando Torres, Wanderson Tenório
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02681
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) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Higher Hamming weights for locally recoverable codes on algebraic curves
- Locally recoverable codes with availability \(t\geq 2\) from fiber products of curves
- Locally recoverable codes from rational maps
- Castle curves and codes
- Weierstrass semigroup and codes over the curve \(y^q + y = x^{q^r + 1}\)
- An Introduction to Algebraic Geometry Codes
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Algebraic Function Fields and Codes
- Generalized Hamming weights for linear codes
- Automorphism groups of one-point codes from the curves y/sup q/+y=x/sup qr+1/
- Locally Recoverable Codes on Algebraic Curves
This page was built for publication: Locally recoverable codes from algebraic curves with separated variables