Linear codes with exponentially many light vectors

DOI10.1006/JCTA.2001.3206zbMATH Open0980.94026OpenAlexW1967600477MaRDI QIDQ5953384FDOQ5953384

Authors: Alexei Ashikhmin, Alexander Barg, Serge Vlăduţ 

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

Recommendations

• Linear codes and character sums
• scientific article; zbMATH DE number 3882337
• scientific article; zbMATH DE number 826046
• Minimal vectors in linear codes
• Polynomial-time construction of codes. I: Linear codes with almost equal weights

zbMATH Keywords

binary linear codesgeometric Goppa codeslight vectorsvectors of minimum weight

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Multiplicative lattices in global fields
• Title not available (Why is that?)
• On the distance distribution of codes
• New upper bounds on error exponents
• Estimates of the distance distribution of codes and designs
• An exhaustion bound for algebraic-geometric ``modular codes
• Title not available (Why is that?)

Cited In (8)

• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
• One more proof of the first linear programming bound for binary codes and two conjectures
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• On the lattice Hadwiger number of superballs and some other bodies
• Title not available (Why is that?)
• On the number of circuits in regular matroids (with connections to lattices and codes)
• Small Linear Dependencies for Binary Vectors of Low Weight
• Lattices with exponentially large kissing numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953384)