Sciweavers

80 search results - page 8 / 16
» Bounds on the decoding complexity of punctured codes on grap...
Sort
View
STACS
2000
Springer
15 years 1 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
JSAC
2007
102views more  JSAC 2007»
14 years 9 months ago
Partially-coherent distributed space-time codes with differential encoder and decoder
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
T. Kiran, B. Sundar Rajan
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 6 months ago
Towards a communication-theoretic understanding of system-level power consumption
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
Pulkit Grover, Kristen Ann Woyach, Anant Sahai
SPAA
2010
ACM
15 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
DAGSTUHL
2006
14 years 10 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev