|
Problemy Peredachi Informatsii, 1988, Volume 24, Issue 1, Pages 11–24
(Mi ppi682)
|
|
|
|
Information Theory and Coding Theory
On the Number of Minimum-Weight Words in Block Codes
A. A. Davydov, L. M. Tombak
Abstract:
Lower bounds on the number of minimum distances are considered for arbitrary block codes of given length, size, and base. These are lower bounds on the number of minimal-weight words for distance-invariant codes containing the null word. We apply the notion of uniformly packed code and MacWilliams's transform of the distance distribution of a code to derive the conditions when these bounds are attainable. Examples of codes attaining this bound are given.
Received: 17.12.1985 Revised: 30.07.1986
Citation:
A. A. Davydov, L. M. Tombak, “On the Number of Minimum-Weight Words in Block Codes”, Probl. Peredachi Inf., 24:1 (1988), 11–24; Problems Inform. Transmission, 24:1 (1988), 7–18
Linking options:
https://www.mathnet.ru/eng/ppi682 https://www.mathnet.ru/eng/ppi/v24/i1/p11
|
|