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.

Saved in:

Bibliographic Details
Published in:	2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 pp. 304 - 307
Main Authors:	Muramatsu, J., Uyematsu, T., Wadayama, T.
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 01.01.2003
Subjects:	Additive noise Channel coding Decoding Entropy Error probability Linear code Parity check codes Performance analysis Source coding Sparse matrices
ISBN:	0780377990, 9780780377998
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!