Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Djordjević et al. (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: