Bounds on distance distributions in codes of given size

DOI10.1007/978-1-4757-3789-9_3MaRDI QIDQ3448741zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Beckner inequality

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• Bounds on Distance Distributions in Codes of Known Size
• Bounds for Binary Codes With Narrow Distance Distributions
• Estimates of the distance distribution of codes and designs
• Estimates of the distance distribution of codes and designs
• Improved upper bounds on sizes of codes

Cites work

• Codes with forbidden distances
• Discrete isoperimetric inequalities and the probability of a decoding error
• scientific article; zbMATH DE number 3499621 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• Inequalities in Fourier analysis
• Linear codes and character sums
• Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
• On relations between covering radius and dual distance
• On the distance distribution of codes
• The threshold probability of a code

Cited in

(17)

• Code distances of some classes of (p,p)-codes
• Estimates of the distance distribution of nonbinary codes, with applications
• Estimates of the distance distribution of codes and designs
• Some Bounds on the Size of Codes
• scientific article; zbMATH DE number 4018402 (Why is no real title available?)
• scientific article; zbMATH DE number 4218374 (Why is no real title available?)
• scientific article; zbMATH DE number 4150083 (Why is no real title available?)
• A limit law on the distance distribution of binary codes
• Bounds on Distance Distributions in Codes of Known Size
• Distance properties of expander codes
• Worst sources and robust codes for difference distortion measures
• Estimates of the distance distribution of codes and designs
• Random codes: minimum distances and error exponents
• Distance Distribution in Reed-Solomon Codes
• An extremum problem for polynomials and bounds for codes with given distance and diameter
• On codes with distances \(d\) and \(n\)
• 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)