An improvement of the Feng-Rao bound for primary codes
From MaRDI portal
Publication:2350925
DOI10.1007/s10623-014-9983-zzbMath1366.94757arXiv1307.3107OpenAlexW2160675478MaRDI QIDQ2350925
Publication date: 25 June 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.3107
minimum distancegeneralized Hamming weightaffine variety codeFeng-Rao bound\(C_{ab}\) curveone-way well behaving pair
Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (4)
Further improvements on the Feng-Rao bound for dual codes ⋮ On affine variety codes from the Klein quartic ⋮ Quantum codes from affine variety codes and their subfield-subcodes ⋮ From primary to dual affine variety codes over the Klein quartic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
- Further improvements on the Feng-Rao bound for dual codes
- On the structure of order domains
- Decoding affine variety codes using Gröbner bases
- On codes from norm-trace curves
- On the characterization of minimal value set polynomials
- Feng-Rao decoding of 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
- Footprints or generalized Bezout's theorem
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- On the existence of order functions
This page was built for publication: An improvement of the Feng-Rao bound for primary codes
