Sciweavers

817 search results - page 135 / 164
» Decoding Choice Encodings
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 1 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
JUCS
2006
95views more  JUCS 2006»
15 years 1 months ago
Fault Tolerant Neural Predictors for Compression of Sensor Telemetry Data
: When dealing with remote systems, it is desirable that these systems are capable of operation within acceptable levels with minimal control and maintenance. In terms or transmiss...
Rajasvaran Logeswaran
TSP
2008
112views more  TSP 2008»
15 years 1 months ago
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes
Abstract--We consider the problem of coding over a half-duplex wireless relay network where both the transmitter and the receiver have respectively several transmit and receive ant...
Frédérique E. Oggier, Babak Hassibi
JSAC
2007
129views more  JSAC 2007»
15 years 1 months ago
Content-Aware Resource Allocation and Packet Scheduling for Video Transmission over Wireless Networks
— A cross-layer packet scheduling scheme that streams pre-encoded video over wireless downlink packet access networks to multiple users is presented. The scheme can be used with ...
Peshala V. Pahalawatta, Randall Berry, Thrasyvoulo...
CORR
2004
Springer
144views Education» more  CORR 2004»
15 years 1 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia