|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 3, Pages 29–37
(Mi ppi1186)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 15.01.1980 Revised: 19.05.1981
Citation:
G. V. Zaitsev, V. A. Zinov'ev, N. V. Semakov, “Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects”, Probl. Peredachi Inf., 19:3 (1983), 29–37; Problems Inform. Transmission, 19:3 (1983), 197–204
Linking options:
https://www.mathnet.ru/eng/ppi1186 https://www.mathnet.ru/eng/ppi/v19/i3/p29
|
Statistics & downloads: |
Abstract page: | 629 | Full-text PDF : | 259 | First page: | 4 |
|