This paper presents lower and upper bounds on the number of parity check digits required for a linear code that locates, corrects, a single sub-block containing errors which are in the form of low-density bursts.
Low-density burst error locating/correcting linear codes
INNAMORATI, STEFANO
1995-01-01
Abstract
This paper presents lower and upper bounds on the number of parity check digits required for a linear code that locates, corrects, a single sub-block containing errors which are in the form of low-density bursts.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
