Codes correcting a set of clusters of errors or erasures

M. Bossert, M. Breitbach, V. Zyablov, V. Sidorenko

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose a class of codes correcting multiple bursts of errors and erasures in the columns of a two-dimensional array. The erasure-correcting codes possess the minimum possible redundancy. The redundancy of the error-correcting codes is close to minimum.

Original languageEnglish
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Pages196
Number of pages1
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: 16 Aug 199821 Aug 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1998 IEEE International Symposium on Information Theory, ISIT 1998
Country/TerritoryUnited States
CityCambridge, MA
Period16/08/9821/08/98

Fingerprint

Dive into the research topics of 'Codes correcting a set of clusters of errors or erasures'. Together they form a unique fingerprint.

Cite this