Low density parity check matrices for coding of multiple access networks
Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama · 2004
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.