Linear codes with exponentially many light vectors
From MaRDI portal
Recommendations
Cites work
- An exhaustion bound for algebraic-geometric ``modular codes
- Estimates of the distance distribution of codes and designs
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 1009721 (Why is no real title available?)
- Multiplicative lattices in global fields
- New upper bounds on error exponents
- On the distance distribution of codes
Cited in
(10)- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- On the lattice Hadwiger number of superballs and some other bodies
- Lattices with exponentially large kissing numbers
- Small Linear Dependencies for Binary Vectors of Low Weight
- scientific article; zbMATH DE number 826046 (Why is no real title available?)
- On the number of circuits in regular matroids (with connections to lattices and codes)
- 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
- Applications of random algebraic constructions to hardness of approximation
- Sparsest cut and eigenvalue multiplicities on low degree abelian Cayley graphs
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)
