Low density parity check matrices for coding of multiple access networks

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 S. 304 - 307
Hauptverfasser: Muramatsu, J., Uyematsu, T., Wadayama, T.
Format: Tagungsbericht
Sprache:Englisch
Japanisch
Veröffentlicht: IEEE 01.01.2003
Schlagworte:
Additive noise
Channel coding
Decoding
Entropy
Error probability
Linear code
Parity check codes
Performance analysis
Source coding
Sparse matrices
ISBN:0780377990, 9780780377998
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:0780377990
9780780377998
DOI:10.1109/ITW.2003.1216754