Estimates for the range of binomiality in codes' spectra

Authors:
I. Krasikov;S. Litsyn
Affiliations:
Sch. of Math. Sci., Tel Aviv Univ.;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

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
A new exponential separation between quantum and classical one-way communication complexity

Quantum Information & Computation

Quantified Score

Hi-index	754.84

Visualization

Abstract

We derive new estimates for the range of binomiality in a code's spectra, where the distance distribution of a code is upperbounded by the corresponding normalized binomial distribution. The estimates depend on the code's dual distance