Sciweavers

3 search results - page 1 / 1
» Group codes outperform binary-coset codes on nonbinary symme...
Sort
View
TIT
2010
90views Education» more  TIT 2010»
12 years 11 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
Giacomo Como
TCOM
2010
111views more  TCOM 2010»
13 years 3 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 4 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