Sciweavers

523 search results - page 15 / 105
» codes 2011
Sort
View
83
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
LCTRTS
2011
Springer
14 years 9 days ago
An approach to improving the structure of error-handling code in the linux kernel
nguage does not provide any abstractions for exception handling or other forms of error handling, leaving programmers to devise their own conventions for detecting and handling er...
Suman Saha, Julia L. Lawall, Gilles Muller
72
Voted
TIT
2011
131views more  TIT 2011»
14 years 4 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
TIT
2011
119views more  TIT 2011»
14 years 4 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
103
Voted
TSP
2011
210views more  TSP 2011»
14 years 4 months ago
Physical Layer Network Coding and Precoding for the Two-Way Relay Channel in Cellular Systems
In this paper, we study the application of physical layer network coding to the joint design of uplink and downlink transmissions, where the base station and the relay have multip...
Zhiguo Ding, Ioannis Krikidis, John S. Thompson, K...