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!
id oai:scielo:S0716-09172020000601577
record_format dspace
spelling oai:scielo:S0716-091720200006015772020-12-02Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocksKumar Das,PankajKumar,Subodh Syndromes Parity check matrix Bound Burst Repeated burst 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.39 n.6 20202020-12-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601577en10.22199/issn.0717-6279-2020-06-0094
institution Scielo Chile
collection Scielo Chile
language English
topic Syndromes
Parity check matrix
Bound
Burst
Repeated burst
spellingShingle Syndromes
Parity check matrix
Bound
Burst
Repeated burst
Kumar Das,Pankaj
Kumar,Subodh
Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
description 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.
author Kumar Das,Pankaj
Kumar,Subodh
author_facet Kumar Das,Pankaj
Kumar,Subodh
author_sort Kumar Das,Pankaj
title Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
title_short Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
title_full Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
title_fullStr Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
title_full_unstemmed Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
title_sort bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
publisher Universidad Católica del Norte, Departamento de Matemáticas
publishDate 2020
url http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000601577
work_keys_str_mv AT kumardaspankaj boundsonlinearcodescapableofdetectinglocatingandcorrectingofrepeatedbursterrorsprevailinginmultiplesubblocks
AT kumarsubodh boundsonlinearcodescapableofdetectinglocatingandcorrectingofrepeatedbursterrorsprevailinginmultiplesubblocks
_version_ 1718439888652599296