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 = 2s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial of 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 embe...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863 |
| País: | Brasil |
| Oai: | oai:scielo:S0001-37652013000300863 |