Buscar
Mostrando ítems 1-10 de 13
Construction of perfect space-time codes
(2013-04-29)
In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over ℚ(ζ3), where the signal constellations are isomorphic ...
Circulant Graphs And Spherical Codes
(, 2006)
A Fast Large Scale Iris Database Classification with Optimum-Path Forest Technique: A Case Study
(IEEE, 2012-01-01)
Majority of biometric researchers focus on the accuracy of matching using biometrics databases, including iris databases, while the scalability and speed issues have been neglected. In the applications such as identification ...