The probability of correcting errors by an antinoise coding method when the number of errors belongs to a random set

被引:1
|
作者
Chuprunov A.N. [1 ]
Khamdeev B.I. [1 ]
机构
[1] Chebotarev Research Institute of Mathematics and Mechanics, Kazan State University, Kazan 420008
关键词
convergence almost sure; generalized allocation scheme; Hamming code;
D O I
10.3103/S1066369X10080098
中图分类号
学科分类号
摘要
We consider n messages of N blocks each, where each block is encoded by some antinoise coding method. The method can correct no more than one error. We assume that the number of errors in the ith message belongs to some finite random subset of nonnegative integer numbers. Let A stand for the event that all errors are corrected; we study the probability P(A) and calculate it in terms of conditional probabilities. We prove that under certain moment conditions probabilities P(A) converge almost sure as n and N tend to infinity so that the value n/N has a finite limit. We calculate this limit explicitly. © 2010 Allerton Press, Inc.
引用
收藏
页码:67 / 73
页数:6
相关论文
共 50 条