MacNeish-Mann theorem based iteratively decodable codes for optical communication systems

Author

Djordjevic, Ivan B. ; Vasic, Bane

Volume

8

Issue

8

fYear

2004

Firstpage

538

Lastpage

540

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.

Keywords

Monte Carlo methods; Reed-Solomon codes; error statistics; forward error correction; iterative decoding; optical fibre communication; parity check codes; turbo codes; wavelength division multiplexing; FEC code; MOLS; MacNeish-Mann theorem; Reed-Solomon code; forward error correction; iterative decoding; low-density parity-check code; mutually orthogonal Latin square construction; optical communications; turbo codes; Code standards; Communication standards; Forward error correction; High speed optical techniques; Iterative decoding; Optical devices; Optical fiber communication; Parity check codes; Turbo codes; Wavelength division multiplexing; FEC; Forward error correction; LDPC; MOLS; MacNeish–Mann theorem; codes; low-density parity-check; mutually orthogonal Latin squares; optical communications;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2004.833833

Filename

1324685