Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 538-540 |
Number of pages | 3 |
Journal | IEEE Communications Letters |
Volume | 8 |
Issue number | 8 |
DOIs | |
State | Published - Aug 2004 |
ASJC Scopus subject areas
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering