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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Kumar Das,Pankaj, Kumar,Subodh
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2020
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601577
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!