Bounds on Distance Distributions in Codes of Given Size
A new upper bound on the possible distance distribution of a code of a given size is proved. The main instrument of the proof is the Beckner inequality from Harmonic Analysis. It is also shown that the obtained bound is almost tight.
KeywordsLinear Code Competitive Ratio Isoperimetric Inequality Network Security Distance Distribution
Unable to display preview. Download preview PDF.