Sciweavers

437 search results - page 35 / 88
» Randomized Lattice Decoding
Sort
View
ICC
2009
IEEE
15 years 6 months ago
Random Linear Network Coding for Time Division Duplexing: Energy Analysis
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 3 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 11 months ago
Dirty Paper Coding using Sign-bit Shaping and LDPC Codes
Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC...
G. Shilpa, Andrew Thangaraj, Srikrishna Bhashyam
ICASSP
2010
IEEE
14 years 6 months ago
Search error risk minimization in Viterbi beam search for speech recognition
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 10 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani