Capacity-Achieving Schemes for Finite-State Channels.

Capacity-Achieving Schemes for Finite-State Channels

[1]  Xiao Ma,et al.  Matched information rate codes for binary ISI channels , 2002, Proceedings IEEE International Symposium on Information Theory,.

[2]  Amin Shokrollahi,et al.  Capacity-achieving sequences for the erasure channel , 2002, IEEE Trans. Inf. Theory.

[3]  Pascal O. Vontobel,et al.  An upper bound on the capacity of channels with memory and constraint input , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[4]  Paul H. Siegel,et al.  Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding , 2007, IEEE Transactions on Information Theory.

[5]  Andrea Montanari,et al.  Tight bounds for LDPC and LDGM codes under MAP decoding , 2004, IEEE Transactions on Information Theory.

[6]  Xiao Ma,et al.  Matched information rate codes for Partial response channels , 2005, IEEE Transactions on Information Theory.

[7]  Sekhar Tatikonda,et al.  The Capacity of Channels With Feedback , 2006, IEEE Transactions on Information Theory.

[8]  Achilleas Anastasopoulos,et al.  A posterior matching scheme for finite-state channels with feedback , 2010, 2010 IEEE International Symposium on Information Theory.

[9]  Aleksandar Kavcic.  On the capacity of Markov sources over noisy channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Sekhar Tatikonda,et al.  A Graphical modeling approach to simplifying sequential teams , 2009, 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[11]  Hans-Andrea Loeliger,et al.  A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels , 2008, IEEE Transactions on Information Theory.

[12]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[13]  Frank R. Kschischang,et al.  On Designing Good LDPC Codes for Markov Channels , 2007, IEEE Transactions on Information Theory.

[14]  Xiao Ma,et al.  Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods , 2009, 2009 IEEE International Symposium on Information Theory.

[15]  Achilleas Anastasopoulos,et al.  Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding , 2010, IEEE Transactions on Information Theory.

[16]  Meir Feder,et al.  Random coding techniques for nonrandom codes , 1999, IEEE Trans. Inf. Theory.

[17]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[18]  Meir Feder,et al.  Optimal Feedback Communication Via Posterior Matching , 2009, IEEE Transactions on Information Theory.

[19]  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.

[20]  Achilleas Anastasopoulos,et al.  Capacity-Achieving Codes for Noisy Channels with Bounded Graphical Complexity and Maximum Likelihood Decoding , 2006 .

[21]  Paul H. Siegel,et al.  Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels , 2004, IEEE Transactions on Information Theory.

[22]  Amin Shokrollahi,et al.  New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity , 1999, AAECC.

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

[24]  Achilleas Anastasopoulos,et al.  Capacity-achieving codes for channels with memory with maximum-likelihood decoding , 2009, 2009 IEEE International Symposium on Information Theory.

[25]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[26]  Achilleas Anastasopoulos,et al.  Capacity-achieving codes for finite-state channels with maximum-likelihood decoding , 2009, IEEE Journal on Selected Areas in Communications.

[27]  Achilleas Anastasopoulos,et al.  Capacity achieving LDPC codes through puncturing , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[28]  Toby Berger,et al.  The capacity of finite-State Markov Channels With feedback , 2005, IEEE Transactions on Information Theory.

[29]  Meir Feder,et al.  Communication with Feedback via Posterior Matching , 2007, 2007 IEEE International Symposium on Information Theory.

[30]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[31]  Frank R. Kschischang,et al.  Analysis of low-density parity-check codes for the Gilbert-Elliott channel , 2005, IEEE Transactions on Information Theory.

[32]  Xiao Ma,et al.  Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds , 2003, IEEE Transactions on Information Theory.

[33]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[34]  Todd P. Coleman,et al.  A stochastic control approach to coding with feedback over degraded broadcast channels , 2010, 49th IEEE Conference on Decision and Control (CDC).

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

[36]  Sekhar Tatikonda,et al.  Feedback capacity of finite-state machine channels , 2005, IEEE Transactions on Information Theory.

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

[38]  Andrea J. Goldsmith,et al.  Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices , 2006, IEEE Transactions on Information Theory.

[39]  Rüdiger L. Urbanke,et al.  Capacity-achieving ensembles for the binary erasure channel with bounded complexity , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[40]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[41]  O. Hernández-Lerma,et al.  Markov chains and invariant probabilities , 2003 .

[42]  M. K. Ghosh,et al.  Discrete-time controlled Markov processes with average cost criterion: a survey , 1993 .

[43]  Paul H. Siegel,et al.  Joint iterative decoding of LDPC codes for channels with memory and erasure noise , 2008, IEEE Journal on Selected Areas in Communications.

[44]  Thomas Kailath,et al.  A coding scheme for additive noise channels with feedback-I: No bandwidth constraint , 1966, IEEE Trans. Inf. Theory.

[45]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[46]  David Burshtein,et al.  Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes , 2000, IEEE Trans. Inf. Theory.

[47]  Harish Viswanathan.  Capacity of Markov Channels with Receiver CSI and Delayed Feedback , 1999, IEEE Trans. Inf. Theory.

[48]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[50]  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.

[51]  Pulkit Grover,et al.  Upper bounds on the rate of LDPC codes for Gilbert-Elliott channels , 2004, Information Theory Workshop.

[52]  Meir Feder,et al.  The posterior matching feedback scheme: Capacity achieving and error analysis , 2008, 2008 IEEE International Symposium on Information Theory.

[53]  Pravin Varaiya,et al.  Capacity, mutual information, and coding for finite-state Markov channels , 1996, IEEE Trans. Inf. Theory.

[54]  Michael Horstein,et al.  Sequential transmission using noiseless feedback , 1963, IEEE Trans. Inf. Theory.

[55]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[56]  Paul H. Siegel,et al.  On near-capacity coding systems for partial-response channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[57]  Nicolas Macris,et al.  Sharp Bounds on Generalized EXIT Functions , 2007, IEEE Transactions on Information Theory.

[58]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[59]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[60]  M. Shokrollahi,et al.  Capacity-achieving sequences , 2001 .

[61]  David Burshtein,et al.  On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.

[62]  Sekhar Tatikonda,et al.  The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback , 2009, IEEE Transactions on Information Theory.

[63]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[64]  Pulkit Grover,et al.  Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels , 2007, IEEE Transactions on Information Theory.