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

Probl. Peredachi Inf., 1983 Volume 19, Issue 3, Pages 29–37 (Mi ppi1186)

This article is cited in 1 paper

Information Theory and Coding Theory

Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects

G. V. Zaitsev, V. A. Zinov'ev, N. V. Semakov


Abstract: The authors propose a new class of codes with minimum redundancy and minimum check density that correct errors, defects, or erasures of byte type. The decoding devices for these codes are simple and have a uniform structure.

UDC: 621.391.15

Received: 15.01.1980
Revised: 19.05.1981


 English version:
Problems of Information Transmission, 1983, 19:3, 197–204

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024