RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1997 Volume 33, Issue 4, Pages 15–25 (Mi ppi384)
This article is cited 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.

UDC: 621.391.15

Received: 02.12.1996
Revised: 29.04.1997


 English version: Problems of Information Transmission, 1997, 33:4, 297–306

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024