Estimates of the distance distribution of codes and designs
From MaRDI portal
Publication:4544541
DOI10.1109/18.915662zbMath1001.94052OpenAlexW2159038374MaRDI QIDQ4544541
Alexander Barg, Alexei Ashikhmin, Simon N. Litsyn
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.915662
boundsconstant weight codesKrawtchouk polynomialspolynomial methoddistance distributionbinomial spectrum
Related Items (5)
Multiplicity of zeros and discrete orthogonal polynomials ⋮ One more proof of the first linear programming bound for binary codes and two conjectures ⋮ STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ Linear codes with exponentially many light vectors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on spectra of codes with known dual distance
- An approximation to the weight distribution of binary linear codes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Linear programming bounds for doubly-even self-dual codes
- Estimates for the range of binomiality in codes' spectra
- More on the distance distribution of BCH codes
- New upper bounds on error exponents
- Binomial moments of the distance distribution: bounds and applications
- New upper bounds on generalized weights
- On the accuracy of the binomial approximation to the distance distribution of codes
- On the optimum of Delsarte's linear program
This page was built for publication: Estimates of the distance distribution of codes and designs
