RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1995 Volume 31, Issue 1, Pages 90–98 (Mi ppi268)

This article is cited in 3 papers

Methods of Signal Processing

On the Limit Distribution of the Distance Between a Random Vector and Some Binary Codes

S. I. Chechëta


Abstract: We obtain theorems on the limit distribution of the Hamming distance between a random vector and some binary codes. We assume that the codes that we consider are distance-invariant; the conditions of the theorems are expressed in terms of the weight (distance) spectrum. The results are applied to obtain a lower bound on the covering radius of a code. As examples, we consider some well-known codes.

UDC: 621.391.1

Received: 05.11.1993
Revised: 09.08.1994


 English version:
Problems of Information Transmission, 1995, 31:1, 78–85

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026