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

Na minha lista:
Detalhes bibliográficos
Principais autores: Kumar Das,Pankaj, Kumar,Subodh
Formato: Digital revista
Idioma:English
Publicado em: Universidad Católica del Norte, Departamento de Matemáticas 2020
Acesso em linha:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601577
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!