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...
Guardado en:
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!
|
Ejemplares similares
-
Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks
por: Kumar Das,Pankaj, et al.
Publicado: (2020) -
Review on 5G NR LDPC Code: Recommendations for DTTB System
por: Fengshuang Li, et al.
Publicado: (2021) -
On locating chromatic number of Möbius ladder graphs
por: Sakri,Redha, et al.
Publicado: (2021) -
Hidden Hypergraphs, Error-Correcting Codes, and Critical Learning in Hopfield Networks
por: Christopher Hillar, et al.
Publicado: (2021) -
High-Efficient Syndrome-Based LDPC Reconciliation for Quantum Key Distribution
por: Hao-Kun Mao, et al.
Publicado: (2021)