Data/hora: 05/06/2024 16:24:55

Provedor de dados: 	42	
País: 	Brazil	
Título: 	A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code	
Autores: 	SHAH,TARIQ; KHAN,MUBASHAR; ANDRADE,ANTONIO A. DE.	
Data: 	2013-09-01	
Ano: 	2013	
Palavras-chave: 	BCH code; Binary cyclic code; Binary Hamming code; Decoding algorithm.	
Resumo: 	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 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.	
Tipo: 	Info:eu-repo/semantics/article	
Idioma: 	Inglês	
Identificador: 	http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0001-37652013000300863	
Editor: 	Academia Brasileira de Ciências	
Relação: 	10.1590/S0001-37652013000300002	
Formato: 	text/html	
Fonte: 	Anais da Academia Brasileira de Ciências  v.85 n.3 2013	
Fonte: 	info:eu-repo/semantics/openAccess