Please use this identifier to cite or link to this item:
|Title:||Structured LDPC codes over integer residue rings|
|Authors:||Armand, M.A. |
|Source:||Armand, M.A., Mo, E. (2008). Structured LDPC codes over integer residue rings. Eurasip Journal on Wireless Communications and Networking 2008 : -. ScholarBank@NUS Repository. https://doi.org/2008/598401|
|Abstract:||This paper presents a new class of low-density parity-check (LDPC) codes over ℤ 2 a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.|
|Source Title:||Eurasip Journal on Wireless Communications and Networking|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.