Abstract:
Messages containing blocks are considered. Each block is encoded with some antinoise coding method, which can correct not more than r mistakes. It is assumed that the number of mistakes in a block is a nonnegative integer valued random variable. The random variables are independent and identically distributed. Also, it is assumed that the number of mistakes in a message belongs to a some finite set of integer numbers. In the paper, the analogs of the Law of Iterated Logarithm for a number of nonerror blocks in a message is proved.
Keywords:generalized allocation scheme; conditional probability; conditional expectation; exponential inequality; Law of Iterated Logarithm; Hamming code.