A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
Fuente:
Redalyc
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artículo científico |
| Sprache: | en |
| Veröffentlicht: |
Academia Brasileira de Ciências
2013
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1876429542585794560 |
|---|---|
| author | TARIQ SHAH |
| author_facet | TARIQ SHAH |
| contents | A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code TARIQ SHAH MUBASHAR KHAN ANTONIO A. DE ANDRADE Multidisciplinaria (Ciencias Naturales y Exactas) BCH code binary cyclic code decoding algorithm binary Hamming code For a given binary BCH code Cn of length n = 2 − 1 generated by a polynomial g(x) 2 F2[x] of degree r there 1 is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x 2 ) 2 F2[x 1 Z ≥ 0] of 2 degree 2r. However, it does exist a binary cyclic code C(n+1)n of length (n + 1)n such that the binary BCH code Cn is embedded in C(n+1)n. Accordingly a high code rate is attained through a binary cyclic code C(n+1)n for a binary BCH code Cn. Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C(n+1)n, while the codes Cn and C(n+1)n have the same minimum hamming distance. 2013 artículo científico 0001-3765 https://www.redalyc.org/articulo.oa?id=32728660002 en http://www.redalyc.org/revista.oa?id=327 Anais da Academia Brasileira de Ciências application/pdf Academia Brasileira de Ciências Anais da Academia Brasileira de Ciências (Brasil) Num.3 Vol.85 |
| format | Artículo científico |
| id | redalyc_32728660002 |
| institution | Redalyc |
| language | en |
| publishDate | 2013 |
| publisher | Academia Brasileira de Ciências |
| spellingShingle | A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code TARIQ SHAH Multidisciplinaria (Ciencias Naturales y Exactas) BCH code binary cyclic code decoding algorithm binary Hamming code A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code TARIQ SHAH MUBASHAR KHAN ANTONIO A. DE ANDRADE Multidisciplinaria (Ciencias Naturales y Exactas) BCH code binary cyclic code decoding algorithm binary Hamming code For a given binary BCH code Cn of length n = 2 − 1 generated by a polynomial g(x) 2 F2[x] of degree r there 1 is no binary BCH code of length (n + 1)n generated by a generalized polynomial g(x 2 ) 2 F2[x 1 Z ≥ 0] of 2 degree 2r. However, it does exist a binary cyclic code C(n+1)n of length (n + 1)n such that the binary BCH code Cn is embedded in C(n+1)n. Accordingly a high code rate is attained through a binary cyclic code C(n+1)n for a binary BCH code Cn. Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C(n+1)n, while the codes Cn and C(n+1)n have the same minimum hamming distance. 2013 artículo científico 0001-3765 https://www.redalyc.org/articulo.oa?id=32728660002 en http://www.redalyc.org/revista.oa?id=327 Anais da Academia Brasileira de Ciências application/pdf Academia Brasileira de Ciências Anais da Academia Brasileira de Ciências (Brasil) Num.3 Vol.85 |
| title | A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code |
| topic | Multidisciplinaria (Ciencias Naturales y Exactas) BCH code binary cyclic code decoding algorithm binary Hamming code |
| url | https://www.redalyc.org/articulo.oa?id=32728660002 |