Codes detecting, locating and correcting random errors occurring in multiple sub-blocks

Abstract In this paper, we study bounds on the number of check digits of linear codes that can detect multiple sub-blocks each affected by e or less random errors and can locate such corrupted multiple sub-blocks. Further, we obtain an upper bound on the number of check digits of linear codes which...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Kumar Das,Pankaj
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2019
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000100129
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:Abstract In this paper, we study bounds on the number of check digits of linear codes that can detect multiple sub-blocks each affected by e or less random errors and can locate such corrupted multiple sub-blocks. Further, we obtain an upper bound on the number of check digits of linear codes which can correct such errors occurring in multiple sub-blocks. We also give examples of such codes.