A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
A novel family of low-density parity-check codes is proposed based on MacNeish-Mann theorem for construction of mutually orthogonal Latin squares. Codes from this family have high code rate, girth at least six, large minimum distance, and significantly outperform conventional forward error correction schemes based on Reed-Solomon (RS) and turbo codes. Index Terms-Forward error correction (FEC), low-density parity-check (LDPC) codes, MacNeish-Mann theorem, mutually orthogonal Latin squaresdoi:10.1109/lcomm.2004.833833 fatcat:wibt2bcgvfc3pdz7r2k7ct3mqe