Estimates of the distance distribution of codes and designs

Authors:
A. Askikhmin;A. Barg;S. Litsyn
Affiliations:
Lucent Technol. Bell Labs., Murray Hill, NJ;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Bounds on the Covering Radius of Linear Codes

Designs, Codes and Cryptography
Some inequalities concerning binomial coefficients and the weight distribution of proper linear codes

ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Binomial and monotonic behavior of the probability of undetected error and the 2-r-bound

WSEAS TRANSACTIONS on COMMUNICATIONS
The dual distance of a CRC and bounds on the probability of undetected error, the weight distribution, and the covering radius

WSEAS TRANSACTIONS on COMMUNICATIONS
The minimum distance of the dual of a CRC

CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics

Quantified Score

Hi-index	754.84

Visualization

Abstract

We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length and for sequences of codes of growing length. Asymptotic results in the paper improve previously known estimates. In particular, we prove the best known bounds on the binomiality range of the distance spectrum of codes with a known dual distance