Higher Hamming weights for locally recoverable codes on algebraic curves

DOI10.1016/j.ffa.2016.03.004zbMath1409.94941arXiv1505.05041OpenAlexW2103533615MaRDI QIDQ285459

Chiara Marcolla, Edoardo Ballico

Publication date: 19 May 2016

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

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

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) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Curves over finite and local fields (11G20) Special divisors on curves (gonality, Brill-Noether theory) (14H51) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (5)

Locally recoverable codes from algebraic curves with separated variables ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ Locally recoverable codes correcting many erasures over small fields ⋮ Locally recoverable codes from rational maps ⋮ Hermitian codes and complete intersections

Cites Work

• Unnamed Item
• Unnamed Item
• On the gonality sequence of an algebraic curve
• Algebraic function fields and 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
• On the Locality of Codeword Symbols
• List Decoding Tensor Products and Interleaved Codes
• List decoding from erasures: bounds and code constructions
• Some New Characters on the Wire-Tap Channel of Type II
• Generalized Hamming weights for linear codes
• On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
• 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
• Fundamentals of Error-Correcting 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

This page was built for publication: Higher Hamming weights for locally recoverable codes on algebraic curves