Sciweavers

64 search results - page 10 / 13
» Distance distribution of binary codes and the error probabil...
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
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,...
Ying Wang, Pierre Moulin
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 7 months ago
A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
Jagadeesh Harshan, B. Sundar Rajan
CIC
2006
121views Communications» more  CIC 2006»
13 years 9 months ago
Performance Studies of a Coding Scheme for a Slepian-Wolf Source Network
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
Azizuddin Abdul Aziz, John C. Kieffer
ICNP
2000
IEEE
13 years 12 months ago
An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees
We study group loss probabilities of Forward Error Correction (FEC) codes in shared loss multicast communication. We present a new analysis model with explicit state equations usi...
Marc Mosko, J. J. Garcia-Luna-Aceves
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami