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.

Uložené v:
Podrobná bibliografia
Vydané v:2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 s. 304 - 307
Hlavní autori: Muramatsu, J., Uyematsu, T., Wadayama, T.
Médium: Konferenčný príspevok..
Jazyk:English
Japanese
Vydavateľské údaje: IEEE 01.01.2003
Predmet:
Additive noise
Channel coding
Decoding
Entropy
Error probability
Linear code
Parity check codes
Performance analysis
Source coding
Sparse matrices
ISBN:0780377990, 9780780377998
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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