11 search results - page 2 / 3 » An Improved Sphere-Packing Bound for Finite-Length Codes Ove... |
TIT
2010
13 years 2 months ago
2010
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
A discrete (binary-input 2q -ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...