Sciweavers

437 search results - page 19 / 88
» Randomized Lattice Decoding
Sort
View
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 1 months ago
Rateless coding with partial state information at the decoder
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
Anand D. Sarwate, Michael Gastpar
102
Voted
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
15 years 6 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
100
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
High-Throughput Non-Orthogonal Interleaved Random Space-Time Coding for Multi-Source Cooperation
Abstract— In this paper, we propose a novel distributed Interleaved Random Space-Time Code (IR-STC) designed for MultiSource Cooperation (MSC) employing various relaying techniqu...
Rong Zhang, Lajos Hanzo
141
Voted
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 3 months ago
Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Ka...
CORR
2008
Springer
78views Education» more  CORR 2008»
15 years 1 months ago
Spread Codes and Spread Decoding in Network Coding
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The ...
Felice Manganiello, Elisa Gorla, Joachim Rosenthal