Binomial moments of the distance distribution: bounds and applications

We study a combinatorial invariant of codes which counts the number of ordered pairs of codewords in all subcodes of restricted support in a code. This invariant can be expressed as a linear form of the components of the distance distribution of the code with binomial numbers as coefficients. For th...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 45; no. 2; pp. 438 - 452
Main Authors:	Ashikhmin, A., Barg, A.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.1999 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Asymptotic properties Binary codes Binomial distribution Binomials Codes Combinatorial analysis Computer programming Computer science Error detection Information theory Invariants Laboratories Linear programming Lower bounds Optimization Postal services Software Upper bound Vectors
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!