Sciweavers

58 search results - page 5 / 12
» Lower Bounds on the Rate-Distortion Function of LDGM Codes
Sort
View
TIT
2011
149views more  TIT 2011»
13 years 2 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 7 months ago
Joint Source-Channel Codes for MIMO Block Fading Channels
—We consider transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt 2 Mr multiple-input multiple-output (MIMO) channel when the channel state informatio...
Deniz Gündüz, Elza Erkip
ICASSP
2008
IEEE
14 years 1 months ago
Source coding with intermittent and degraded side information at the decoder
Practical schemes for distributed video coding with side information at the decoder need to consider non-standard correlation models in order to take non-stationarities into accou...
Francesca Bassi, Michel Kieffer, Claudio Weidmann
DCC
2007
IEEE
14 years 7 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
TIT
1998
86views more  TIT 1998»
13 years 7 months ago
A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
Vladislav Sorokine, Frank R. Kschischang