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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 45; číslo 2; s. 438 - 452
Hlavní autori:	Ashikhmin, A., Barg, A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.1999 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!