A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic 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...

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
में प्रकाशित:Anais da Academia Brasileira de Ciências
मुख्य लेखकों: TARIQ SHAH, MUBASHAR KHAN, ANTONIO A. DE ANDRADE
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: Academia Brasileira de Ciências 2013
विषय:
Multidisciplinaria (Ciencias Naturales y Exactas)
BCH code
binary cyclic code
decoding algorithm
binary Hamming code
ऑनलाइन पहुंच:https://www.redalyc.org/articulo.oa?id=32728660002
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन