In Praise of Bad Codes for Multi-Terminal Communications

[1]  Robert M. Gray,et al.  Coding for noisy channels , 2011 .

[2]  Uri Erez,et al.  Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate , 2008, IEEE Transactions on Communications.

[3]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[4]  Jr. G. Forney,et al.  Viterbi Algorithm , 1973, Encyclopedia of Machine Learning.

[5]  Andrea Montanari,et al.  The Generalized Area Theorem and Some of its Consequences , 2005, IEEE Transactions on Information Theory.

[6]  Michael Gastpar,et al.  Compute-and-forward: Harnessing interference with structured codes , 2008, 2008 IEEE International Symposium on Information Theory.

[7]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[8]  David Declercq,et al.  Characterization and Optimization of LDPC Codes for the 2-User Gaussian Multiple Access Channel , 2007, EURASIP J. Wirel. Commun. Netw..

[9]  Daniel Pérez Palomar,et al.  Representation of Mutual Information Via Input Estimates , 2007, IEEE Transactions on Information Theory.

[10]  Sichao Yang,et al.  Network Coding over a Noisy Relay : a Belief Propagation Approach , 2007, 2007 IEEE International Symposium on Information Theory.

[11]  Gerhard Kramer,et al.  Cooperative Communications , 2007, Found. Trends Netw..

[12]  Branka Vucetic,et al.  Distributed Turbo Coding With Soft Information Relaying in Multihop Relay Networks , 2006, IEEE Journal on Selected Areas in Communications.

[13]  S.A. Jafar,et al.  Optimizing Soft Information in Relay Networks , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[14]  Simon Litsyn,et al.  Upper bounds on the rate of LDPC codes as a function of minimum distance , 2002, IEEE Transactions on Information Theory.

[15]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[16]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[17]  Somchai Jitapunkul,et al.  Iterative partial soft interference cancellation with MMSE multiuser detection for uplink turbo-coded MC-CDMA system , 2005, 3rd Annual Communication Networks and Services Research Conference (CNSR'05).

[18]  Shlomo Shamai,et al.  LDPC coded MIMO multiple access with iterative joint decoding , 2005, IEEE Transactions on Information Theory.

[19]  Shlomo Shamai,et al.  Mutual information and minimum mean-square error in Gaussian channels , 2004, IEEE Transactions on Information Theory.

[20]  Alon Orlitsky,et al.  Stopping set distribution of LDPC code ensembles , 2003, IEEE Transactions on Information Theory.

[21]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[22]  Jörg Kliewer,et al.  Soft-input reconstruction of binary transmitted quantized overcomplete expansions , 2004, IEEE Signal Processing Letters.

[23]  Ralf R. Müller,et al.  Iterative multiuser joint decoding: optimal power allocation and low-complexity implementation , 2004, IEEE Transactions on Information Theory.

[24]  David Burshtein,et al.  Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.

[25]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[26]  Rüdiger L. Urbanke,et al.  Parity-check density versus performance of binary linear block codes over memoryless symmetric channels , 2003, IEEE Transactions on Information Theory.

[27]  Jae Hong Lee,et al.  Multi-Stage Partial Parallel Interference Cancellation Receivers for Multi-Rate DS-CDMA System , 2003 .

[28]  Abdelaziz Amraoui,et al.  Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[29]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[30]  Chin-Liang Wang,et al.  An iterative multiuser receiver using partial parallel interference cancellation for turbo-coded DS-CDMA systems , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[31]  Giuseppe Caire,et al.  Successive interference cancellation with SISO decoding and EM channel estimation , 2001, IEEE Journal on Selected Areas in Communications.

[32]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[33]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[34]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[35]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[36]  H. Vincent Poor,et al.  Iterative (turbo) soft interference cancellation and decoding for coded CDMA , 1999, IEEE Trans. Commun..

[37]  Dariush Divsalar,et al.  Improved parallel interference cancellation for CDMA , 1998, IEEE Trans. Commun..

[38]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[39]  S. Shamai,et al.  The empirical distribution of good codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[40]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[41]  Max H. M. Costa,et al.  The capacity region of the discrete memoryless interference channel with strong interference , 1987, IEEE Trans. Inf. Theory.

[42]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[43]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[44]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[45]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[46]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[47]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[48]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .