Sciweavers

133 search results - page 7 / 27
» Linear Operator Channels over Finite Fields
Sort
View
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 7 months ago
MIMO Broadcast Channels with Block Diagonalization and Finite Rate Feedback
Block diagonalization is a linear precoding technique for the multiple antenna broadcast (downlink) channel that involves transmission of multiple data streams to each receiver su...
Niranjay Ravindran, Nihar Jindal
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 7 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
DCC
2006
IEEE
14 years 7 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 7 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
TC
2008
13 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...