Sciweavers

3852 search results - page 49 / 771
» Construction of Codes for Network Coding
Sort
View
DCC
2008
IEEE
15 years 9 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
CORR
2006
Springer
131views Education» more  CORR 2006»
14 years 10 months ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
ICMCS
2007
IEEE
130views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Wyner-Ziv Video Coding Based on Turbo Codes Exploiting Perfect Knowledge of Parity Bits
In a Wyner-Ziv video coding system based on turbo codes, parity bits are generated for a Wyner-Ziv frame and transmitted to the decoder. In this context of distributed source codi...
Hu Chen, Eckehard G. Steinbach
CODES
2007
IEEE
14 years 10 months ago
Automotive networks: are new busses and gateways the answer or just another challenge?
Rolf Ernst, Gernot Spiegelberg, Thomas Weber, Herm...
AAECC
2006
Springer
74views Algorithms» more  AAECC 2006»
15 years 4 months ago
Nested Codes for Constrained Memory and for Dirty Paper
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
Hans Georg Schaathun, Gérard D. Cohen