Further improvements on the Feng-Rao bound for dual codes

DOI10.1016/j.ffa.2014.05.006zbMath1343.94104arXiv1305.1091OpenAlexW1989016398MaRDI QIDQ405954

Olav Geil, Stefano Martin

Publication date: 8 September 2014

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

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

zbMATH Keywords

minimum distancegeneralized Hamming weightadvisory boundaffine variety codeFeng-Rao boundwell-behaving pair

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (2)

An improvement of the Feng-Rao bound for primary codes ⋮ From primary to dual affine variety codes over the Klein quartic

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of order domains
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• Decoding affine variety codes using Gröbner bases
• An improvement of the Feng-Rao bound for primary codes
• Evaluation codes from order domain theory
• An improvement of the Feng-Rao bound on minimum distance
• Some New Characters on the Wire-Tap Channel of Type II
• Generalized Hamming weights for linear codes
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• Generalized Hamming weights of q-ary Reed-Muller codes
• Improved geometric Goppa codes. I. Basic theory
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Further improvements on the Feng-Rao bound for dual codes