| Publication | Date of Publication | Type |
|---|
Block error correcting codes using finite-field wavelet transforms
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
On performance limits of space-time codes: a sphere-packing bound approach
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity Analysis for Continuous-Alphabet Channels With Side Information, Part I: A General Framework
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity Analysis for Continuous Alphabet Channels With Side Information, Part II: MIMO Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On Space–Time Coding in the Presence of Spatio-Temporal Correlation
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Low-density parity-check codes over gaussian channels with erasures
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Rate-Compatible Puncturing of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity achieving code constructions for two classes of (d,k) constraints
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Applications of LDPC Codes to the Wiretap Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Cramér-Rao bound for timing recovery on channels with intersymbol interference | 2008-04-29 | Paper |
SCALABLE AND EFFICIENT IMPLEMENTATIONS OF THE LDPC DECODER USING RECONFIGURABLE MODELS
International Journal of Foundations of Computer Science | 2006-05-10 | Paper |
Jointly optimized trellis-coded residual vector quantization
IEEE Transactions on Communications | 2004-01-11 | Paper |
Twin-stack decoding of recursive systematic convolutional codes
IEEE Transactions on Communications | 2003-06-19 | Paper |
Quantum codes from cyclic codes over GF(4/sup m/)
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Optimal block codes for M-ary runlength-constrained channels
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1504680 (Why is no real title available?) | 2002-06-13 | Paper |
An enumerative method for runlength-limited codes: permutation codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Shannon capacity of M-ary redundant multitrack runlength limited codes
IEEE Transactions on Information Theory | 1998-10-27 | Paper |
Shaping codes constructed from cost-constrained graphs
IEEE Transactions on Information Theory | 1997-12-15 | Paper |
The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states
IEEE Transactions on Information Theory | 1997-06-10 | Paper |
Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
IEEE Transactions on Information Theory | 1996-11-12 | Paper |
On the capacity of M-ary runlength-limited codes
IEEE Transactions on Information Theory | 1996-02-08 | Paper |
| scientific article; zbMATH DE number 515901 (Why is no real title available?) | 1994-03-10 | Paper |
