Linear codes with exponentially many light vectors

DOI10.1006/jcta.2001.3206zbMath0980.94026OpenAlexW1967600477MaRDI QIDQ5953384

Alexander Barg, Alexei Ashikhmin, S. G. Vleduts

Publication date: 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1ea0a83e0a0201f9fbebc2c8f739ab6f2dca773e

zbMATH Keywords

binary linear codesgeometric Goppa codeslight vectorsvectors of minimum weight

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (6)

One more proof of the first linear programming bound for binary codes and two conjectures ⋮ Lattices with exponentially large kissing numbers ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ On the lattice Hadwiger number of superballs and some other bodies ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

Cites Work

• Unnamed Item
• Unnamed Item
• An exhaustion bound for algebraic-geometric ``modular codes
• Multiplicative lattices in global fields
• Estimates of the distance distribution of codes and designs
• New upper bounds on error exponents
• On the distance distribution of codes

This page was built for publication: Linear codes with exponentially many light vectors