|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 4, Pages 15–25
(Mi ppi384)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Information Theory and Coding Theory
Codes Correcting a Set of Clusters of Errors or Erasures
M. Bossert, M. Breitbach, V. V. Zyablov, V. R. Sidorenko
Abstract:
We propose a class of codes correcting multiple bursts of errors or erasures in columns of a two-dimensional array. Erasure-correcting codes possess minimum possible redundancy. The redundancy of error-correcting codes is close to minimum.
Received: 02.12.1996 Revised: 29.04.1997
Citation:
M. Bossert, M. Breitbach, V. V. Zyablov, V. R. Sidorenko, “Codes Correcting a Set of Clusters of Errors or Erasures”, Probl. Peredachi Inf., 33:4 (1997), 15–25; Problems Inform. Transmission, 33:4 (1997), 297–306
Linking options:
https://www.mathnet.ru/eng/ppi384 https://www.mathnet.ru/eng/ppi/v33/i4/p15
|
|