Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks

Abstract Linear codes are presented that can detect, locate and correct all repeated burst errors of length b or less which occur in multiple sub-blocks. We obtain lower and upper bounds on the number of check digits for the existence of these codes. Three examples, one for each type of code, are pr...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Kumar Das,Pankaj, Kumar,Subodh
Langue:English
Publié: Universidad Católica del Norte, Departamento de Matemáticas 2020
Sujets:
Accès en ligne:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601577
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!