Codes on graphs: Normal realizations
暂无分享,去创建一个
[1] S. Kaplan. Extensions of the Pontrjagin duality I: Infinite products , 1948 .
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] W. Rudin,et al. Fourier Analysis on Groups. , 1965 .
[4] A. Bryson,et al. Finite Group Homomorphic Sequential Systems , 1966 .
[5] A. Willsky,et al. Finite group homomorphic sequential system , 1972 .
[6] Carlos R. P. Hartmann,et al. An optimum symbol-by-symbol decoding rule for linear codes , 1976, IEEE Trans. Inf. Theory.
[7] Philippe Godlewski,et al. Replication decoding , 1979, IEEE Trans. Inf. Theory.
[8] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[9] G. David Forney,et al. Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.
[10] Jan C. Willems,et al. Models for Dynamics , 1989 .
[11] W. Rudin. Fourier Analysis on Groups: Rudin/Fourier , 1990 .
[12] J. Willems. Paradigms and puzzles in the theory of dynamical systems , 1991 .
[13] 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.
[14] Mitchell D. Trott,et al. The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders , 1993, IEEE Trans. Inf. Theory.
[15] G. Forney,et al. Minimality and observability of group systems , 1994 .
[16] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] G. Forney,et al. Controllability, observability, and duality in behavioral group systems , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.
[18] Hans-Andrea Loeliger,et al. Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..
[19] Radford M. Neal,et al. Near Shannon Limit Performance of Low Density Parity Check Codes , 1996 .
[20] Hans-Andrea Loeliger,et al. Convolutional codes over groups , 1996, IEEE Trans. Inf. Theory.
[21] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[22] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[23] F. Burkert,et al. Turbo-decoding of nonbinary codes , 1997, Proceedings of IEEE International Symposium on Information Theory.
[24] David J. C. MacKay,et al. Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.
[25] Sven Riedel. Symbol-by-Symbol MAP Decoding Algorithm for High-Rate Convolutional Codes That Use Reciprocal Dual Codes , 1998, IEEE J. Sel. Areas Commun..
[26] G. Forney,et al. Transforms and Groups , 1998 .
[27] Jung-Fu Cheng,et al. Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..
[28] Alexander Reznik. Iterative decoding of codes defined on graphs , 1998 .
[29] J. Berkmann. A symbol-by-symbol MAP decoding rule for linear codes over rings using the dual code , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[30] A. Vardy,et al. Factor graphs: constructions, classification, and bounds , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[31] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[32] Brendan J. Frey,et al. Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..
[33] D. Mackay,et al. Low-Density Parity Check Codes over , 1998 .
[34] G. David Forney. Group Codes and Behaviors , 1999 .
[35] A. Robert Calderbank,et al. Minimal tail-biting trellises: The Golay code and more , 1999, IEEE Trans. Inf. Theory.
[36] Robert J. McEliece,et al. The generalized distributive law , 2000, IEEE Trans. Inf. Theory.
[37] R. Schumann. Quantum Information Theory , 2000, quant-ph/0010060.
[38] T. Richardson,et al. Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[39] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[40] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[41] Hans-Andrea Loeliger,et al. Probability propagation and decoding in analog VLSI , 2001, IEEE Trans. Inf. Theory.
[42] W. Freeman,et al. Bethe free energy, Kikuchi approximations, and belief propagation algorithms , 2001 .
[43] William T. Freeman,et al. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.
[44] Sae-Young Chung,et al. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.
[45] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.