Show simple item record

dc.creatorDas, Pankaj Kumar
dc.creatorKumar, Subodh
dc.date2020-11-19
dc.date.accessioned2021-01-29T12:45:34Z
dc.date.available2021-01-29T12:45:34Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3720
dc.identifier10.22199/issn.0717-6279-2020-06-0094
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/163972
dc.descriptionLinear 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.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3720/3606
dc.rightsCopyright (c) 2020 Pankaj Kumar Das, Subodh Kumaren-US
dc.rightshttp://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 39 No. 6 (2020); 1577-1596en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 39 Núm. 6 (2020); 1577-1596es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2020-06
dc.subjectSyndromesen-US
dc.subjectParity check matrixen-US
dc.subjectBounden-US
dc.subjectBursten-US
dc.subjectRepeated bursten-US
dc.subject94B05en-US
dc.subjectLinear codes, generalen-US
dc.subject94B65en-US
dc.subjectBounds on codesen-US
dc.titleBounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocksen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record