Higher Hamming weights for locally recoverable codes on algebraic curves
From MaRDI portal
(Redirected from Publication:285459)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Plane and space curves (14H50) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Special divisors on curves (gonality, Brill-Noether theory) (14H51) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Abstract: We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC codes, that are LRC codes from Norm-Trace curve. Finally, using some properties of Hermitian codes, we improve the bounds of distance proposed in [1] for some Hermitian LRC codes. [1] A. Barg, I. Tamo, and S. Vlladut. Locally recoverable codes on algebraic curves. arXiv preprint arXiv:1501.04904, 2015.
Recommendations
- Locally recoverable codes on algebraic curves
- Locally recoverable codes on the algebraic function fields
- Locally recoverable codes from algebraic curves and surfaces
- Locally recoverable codes from algebraic curves with separated variables
- Quadratic forms, generalized Hamming weights of codes and curves with many points
Cites work
- scientific article; zbMATH DE number 125906 (Why is no real title available?)
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- A Family of Optimal Locally Recoverable Codes
- A characterization of Hermitian function fields over finite fields.
- Algebraic function fields and codes
- Dimension/length profiles and trellis complexity of linear block codes
- Fundamentals of Error-Correcting Codes
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Gonality of modular curves in characteristic \(p\)
- List decoding from erasures: bounds and code constructions
- Locally Repairable Codes
- Network Generalized Hamming Weight
- On Generalized Hamming Weights and the Covering Radius of Linear Codes
- On codes from norm-trace curves
- On complexity of trellis structure of linear block codes
- On the Locality of Codeword Symbols
- On the generalized Hamming weights of geometric Goppa codes
- On the gonality sequence of an algebraic curve
- On the locality of codeword symbols in non-linear codes
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
- On the weight hierarchy of geometric Goppa codes
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- Secure Computation from Random Error Correcting Codes
- Some New Characters on the Wire-Tap Channel of Type II
- The second and third generalized Hamming weights of Hermitian codes
- The second generalized Hamming weight for two-point codes on a Hermitian curve
- The second generalized Hamming weight of certain Castle codes
Cited in
(6)- Locally recoverable codes on the algebraic function fields
- Locally recoverable codes from algebraic curves with separated variables
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Hermitian codes and complete intersections
- Locally recoverable codes correcting many erasures over small fields
- Locally recoverable codes from rational maps
This page was built for publication: Higher Hamming weights for locally recoverable codes on algebraic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285459)
