ACM Home Page
Please provide us with feedback. Feedback
Analysis of low density codes and improved designs using irregular graphs
Full text PdfPdf (1.27 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirtieth annual ACM symposium on Theory of computing table of contents
Dallas, Texas, United States
Pages: 249 - 258  
Year of Publication: 1998
ISBN:0-89791-962-9
Authors
M. Luby  International Computer Science Institute, Berkeley, CA
M. Mitzenmacher  Digital Equipment Corporation, Systems Research Center, Palo Alto, CA
A. Shokrollah  International Computer Science, Institute Berkeley, and Institut für Informatik der Universitüt Bonn, Germany
D. Spielman  Department of Mathematics, M.I.T.
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 103,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276698.276756
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
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.
 
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.
 
3
D. Divsalar and F. Pollara, "On the Design of Turbo Codes", JPL TDA Progress Report 42-123.
 
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.
 
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.
 
6
R. G. Gallager, Low-Density Parity-Check Codes, MiT Press, 1963.
7
 
8
 
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.
 
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.
 
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.
 
12
D.J.C. MacKay and R. M. Neal, "Near Shannon Limit Performance of Low Density Parity Cheek Codes", to appear in Electronic Letters.
 
13
 
14
 
15
M. Sipser, D. A. Spielman, "Expander Codes", IEEE Transactions on Information Theory, 42(6), November 1996, pp. 1710-1722.
 
16
D. A. Spielman, "Linear Time Eneodable and Decodable Error-Correcting Codes", IEEE Transactions on Information Theory, 42(6), November 1996, pp. 1723- 1731.
 
17
N. Wiberg, "Codes and decoding on general graphs" Ph.D. dissertation, Dept. Elec. Eng, U. LinkSping, Sweeden, April 1996.

CITED BY  10

Collaborative Colleagues:
M. Luby: colleagues
M. Mitzenmacher: colleagues
A. Shokrollah: colleagues
D. Spielman: colleagues