Higher Hamming weights for locally recoverable codes on algebraic curves

DOI10.1016/J.FFA.2016.03.004zbMATH Open1409.94941arXiv1505.05041OpenAlexW2103533615MaRDI QIDQ285459FDOQ285459

E. Ballico, Chiara Marcolla

Publication date: 19 May 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1505.05041

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

zbMATH Keywords

algebraic geometric LRC codeshigher Hamming weightsnorm-trace LRC codes

Mathematics Subject Classification ID

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)

Cites Work

• On the Locality of Codeword Symbols
• List Decoding Tensor Products and Interleaved Codes
• Fundamentals of Error-Correcting Codes
• Algebraic function fields and codes
• Generalized Hamming weights for linear codes
• The second generalized Hamming weight for two-point codes on a Hermitian curve
• On codes from norm-trace curves
• The second generalized Hamming weight of certain Castle codes
• Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
• On the locality of codeword symbols in non-linear codes
• Gonality of modular curves in characteristic \(p\)
• Locally Repairable Codes
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• A Family of Optimal Locally Recoverable Codes
• List decoding from erasures: bounds and code constructions
• Some New Characters on the Wire-Tap Channel of Type II
• Title not available (Why is that?)
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• Title not available (Why is that?)
• On complexity of trellis structure of linear block codes
• A characterization of Hermitian function fields over finite fields.
• Generalized Hamming weights of q-ary Reed-Muller codes
• The second and third generalized Hamming weights of Hermitian codes
• On the weight hierarchy of geometric Goppa codes
• Dimension/length profiles and trellis complexity of linear block codes
• On the generalized Hamming weights of geometric Goppa codes
• Network Generalized Hamming Weight
• On Generalized Hamming Weights and the Covering Radius of Linear Codes
• Secure Computation from Random Error Correcting Codes
• On the gonality sequence of an algebraic curve

Cited In (5)

• 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)