Сorrespondence

On One Property of the Hamming Code

Yu. L. Sagalovich


Abstract: We derive a necessary and sufficient condition for correction of all byte errors of length 2 by the code formed by lengthening the extended cyclic Hamming code by one bit while preserving the parity check. The problem is shown to be noninvariant relative to various primitive polynomials generating the Hamming code.

UDC: 621.391.15

Received: 13.06.1986

 English version: Problems of Information Transmission, 1988, 24:1, 79–81

Bibliographic databases:

• 
•