Low density parity check matrices for coding of multiple access networks | IEEE Conference Publication | IEEE Xplore
Subscribe
ADVANCED SEARCH
Conferences >Proceedings 2003 IEEE Informa...

Low density parity check matrices for coding of multiple access networks

PDF
J. Muramatsu; T. Uyematsu; T. Wadayama
All Authors

Abstract:

The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also c...Show More

Metadata

Abstract:

The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also called low density parity check (LDPC) matrices.
Published in: Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)
Date of Conference: 31 March 2003 - 04 April 2003
Date Added to IEEE Xplore: 04 August 2003
Print ISBN:0-7803-7799-0
DOI: 10.1109/ITW.2003.1216754
Conference Location: Paris, France
Contents
Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.