Sciweavers

171 search results - page 31 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
ICC
2007
IEEE
182views Communications» more  ICC 2007»
14 years 1 months ago
BER Analysis of MIMO-SVD Systems with Channel Estimation Error and Feedback Delay
— This paper analyzes the average bit error rate (BER) performance of singular value decomposition-based multiple-input multiple-output systems with channel estimation error and ...
Edward K. S. Au, Shi Jin, Matthew R. McKay, Wai Ho...
VTC
2007
IEEE
128views Communications» more  VTC 2007»
14 years 1 months ago
Performance of Space-Code-Division Multiple-Access Systems Using Reduced-Rank Detection
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
Jiliang Zhang, Lie-Liang Yang
ACISP
2005
Springer
14 years 27 days ago
Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
Bo-Yin Yang, Jiun-Ming Chen
CHES
2005
Springer
156views Cryptology» more  CHES 2005»
14 years 27 days ago
A Very Compact S-Box for AES
A key step in the Advanced Encryption Standard (AES) algorithm is the “S-box.” Many implementations of AES have been proposed, for various goals, that effect the S-box in vari...
David Canright
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 5 days ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...