A bound for codes correcting random and low-density closed-loop burst errors
This paper presents a lower bound on the number of parity-check digits required for a linear code that corrects random errors and errors which are in the form of closed-loop ion-density bursts.
Main Authors: | L Berardi, B. K. Dass |
---|---|
Format: | Article |
Language: | English |
Published: |
Accademia Piceno Aprutina dei Velati
1993-02-01
|
Series: | Ratio Mathematica |
Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/169 |
Similar Items
-
MODERATE-DENSITY CLOSE-CLOSED LOOP BURST ERROR DETECTING CODES
by: Bal Kishan Dass, et al.
Published: (2003-02-01) -
MODERATE-DENSITY BURST ERROR CORRECTING LINEAR CODES
by: Bal Kishan Dass, et al.
Published: (2003-02-01) -
Error Locating Codes Dealing with Repeated Low-Density Burst Errors
by: Bal Kishan Dass, et al.
Published: (2010-12-01) -
Burst error correcting perfect codes.
by: B. Kishan Dass, et al.
Published: (2003-02-01) -
Blockwise Repeated Burst Error Correcting Linear Codes
by: B.K. Dass, et al.
Published: (2010-12-01)