Ranks and kernels of codes from generalized Hadamard matrices

Steven T. Dougherty, Josep Rifà, Mercè Villanueva

Producción científica: Contribución a una revistaArtículoInvestigaciónrevisión exhaustiva

12 Citas (Scopus)

Resumen

© 2015 IEEE. The ranks and kernels of generalized Hadamard matrices are studied. It is proved that any generalized Hadamard matrix H(q,λ) over Fq, q > 3, or q = 3 and gcd(3, λ) = 1, generates a self-orthogonal code. This result puts a natural upper bound on the rank of the generalized Hadamard matrices. Lower and upper bounds are given for the dimension of the kernel of the corresponding generalized Hadamard codes. For specific ranks and dimensions of the kernel within these bounds, generalized Hadamard codes are constructed.
Idioma originalInglés
Número de artículo7362191
Páginas (desde-hasta)687-694
PublicaciónIEEE Transactions on Information Theory
Volumen62
DOI
EstadoPublicada - 1 feb 2016

Huella

Profundice en los temas de investigación de 'Ranks and kernels of codes from generalized Hadamard matrices'. En conjunto forman una huella única.

Citar esto