Bounds on Distance Distributions in Codes of Given Size
From MaRDI portal
Publication:3448741
DOI10.1007/978-1-4757-3789-9_3zbMath1330.94065OpenAlexW2567326718MaRDI QIDQ3448741
Michael Krivelevich, Gérard D. Cohen, Simon N. Litsyn
Publication date: 27 October 2015
Published in: Communications, Information and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4757-3789-9_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequalities in Fourier analysis
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- Linear codes and character sums
- Codes with forbidden distances
- Discrete Isoperimetric Inequalities and the Probability of a Decoding Error
- On relations between covering radius and dual distance
- The threshold probability of a code
- On the distance distribution of codes
This page was built for publication: Bounds on Distance Distributions in Codes of Given Size
