Bounds on distance distributions in codes of given size
From MaRDI portal
Publication:3448741
DOI10.1007/978-1-4757-3789-9_3zbMATH Open1330.94065OpenAlexW2567326718MaRDI QIDQ3448741FDOQ3448741
Authors: Michael Krivelevich, Gérard Cohen, Simon 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
Recommendations
Cites Work
- Inequalities in Fourier analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the distance distribution of codes
- Codes with forbidden distances
- Title not available (Why is that?)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- On relations between covering radius and dual distance
- Linear codes and character sums
- The threshold probability of a code
- Discrete isoperimetric inequalities and the probability of a decoding error
Cited In (17)
- Estimates of the distance distribution of codes and designs
- Distance Distribution in Reed-Solomon Codes
- Title not available (Why is that?)
- A limit law on the distance distribution of binary codes
- Some Bounds on the Size of Codes
- Title not available (Why is that?)
- On codes with distances \(d\) and \(n\)
- Code distances of some classes of \((p,p)\)-codes
- Worst sources and robust codes for difference distortion measures
- Estimates of the distance distribution of codes and designs
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Distance properties of expander codes
- Estimates of the distance distribution of nonbinary codes, with applications
- Random codes: minimum distances and error exponents
- Bounds on Distance Distributions in Codes of Known Size
- Title not available (Why is that?)
- New bounds on the distance distribution of extended Goppa codes
This page was built for publication: Bounds on distance distributions in codes of given size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448741)