M. Luby
M. Mitzenmacher
- 1.C. Berrou, A Glavieux, and P. Thitimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes", Proceedings of lEEE International Communications Conference, 1993.Google Scholar
Cross Ref
- 2.J.-F. Cheng and R. J. MeEliece, "Some High-Rate Near Capacity Codecs for the Gaussian Channel", 34th Allerton Conference on Communications, Control and Computing.Google Scholar
- 3.D. Divsalar and F. Pollara, "On the Design of Turbo Codes", JPL TDA Progress Report 42-123.Google Scholar
- 4.G.D. Forney, Jr. 'q'he Forwaxd-Baekward Algorithm", Proceedings of the $4th Allerton Conference on Communications, Control and Computing, 1996, pp. 432- 446.Google Scholar
- 5.B. 3. Frey and E tL Ksehisehang, "Probability Propagation and Iterafive Decoding", Proceedings of the $4th Allerton Conference on Communications, Control and Computing, 1996.Google Scholar
- 6.R. G. Gallager, Low-Density Parity-Check Codes, MiT Press, 1963.Google Scholar
- 7.M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical Loss-Resilient Codes", Pro& 29th Syrup. on Theory of Compt~ting, 1997, pp. 150-159. Google ScholarDigital Library
- 8.M. Luby, M. Mitzenmaeher, and M. A. Shokrollahi, "Analysis of Random Processes via And-Or Trees", Proc. 9ta $ymp. on Discrete Algorithms, 1998. Google ScholarDigital Library
- 9.M. Luby, M. Mitzenmaeher, M. A. Shokrollahi, and D. A. Spielman, "Improved Low Density Parity Cheek Codes Using irregular Graphs and Belief Propagation", submitted to the 1998 International Symposium on Information Theory.Google Scholar
- 10.D. J. C. MacKay, R, J. McEliece, and J.-F. Cheng, "Turbo Coding as an Instance of Pearl's 'Belief Propagation' Algorithm", to appear in IEEE Journal on Selected Areas in Communication. Google ScholarDigital Library
- 11.D.J.C. MacKay and R. M. Neal, "Good Error Correcting Codes Based on Very Sparse Matrices", available from http ://wol.ra.phy. cam. ae.uk/mackay.Google Scholar
- 12.D.J.C. MacKay and R. M. Neal, "Near Shannon Limit Performance of Low Density Parity Cheek Codes", to appear in Electronic Letters.Google Scholar
- 13.R. Motwani and P. Raghavan, Randomized Algo. rithms, Cambridge University Press, 1995. Google ScholarDigital Library
- 14.J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible inference, Morgan Kaufmann Publishers, 1988. Google ScholarDigital Library
- 15.M. Sipser, D. A. Spielman, "Expander Codes", IEEE Transactions on Information Theory, 42(6), November 1996, pp. 1710-1722. Google ScholarCross Ref
- 16.D. A. Spielman, "Linear Time Eneodable and Decodable Error-Correcting Codes", IEEE Transactions on Information Theory, 42(6), November 1996, pp. 1723- 1731. Google ScholarCross Ref
- 17.N. Wiberg, "Codes and decoding on general graphs" Ph.D. dissertation, Dept. Elec. Eng, U. LinkSping, Sweeden, April 1996.Google Scholar
Index Terms
- Analysis of low density codes and improved designs using irregular graphs
Recommendations
Triangle-free subcubic graphs with minimum bipartite density
A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is max{@e(H)/@e(G):H is a bipartite subgraph of G}, where @e(H) and @e(G) denote the numbers of edges in H and G, respectively. It is an NP-hard problem to ...
On decomposing regular graphs into locally irregular subgraphs
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. We say that a graph G can be decomposed into k locally irregular subgraphs if its edge set may be partitioned into k subsets each of which induces a locally irregular ...
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs
Let G be a graph. The irregularity index of G , denoted by t ( G ), is the number of distinct values in the degree sequence of G . For any graph G , t ( G ) ≤ Δ( G ), where Δ( G ) is the maximum degree. If t ( G ) = Δ( G ), then G is ...
Comments