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

Ivan B. Djordjevic; Bane Vasic

doi:10.1109/LCOMM.2004.833833

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

Ivan B. Djordjevic
, Bane Vasic

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

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	https://doi.org/10.1109/LCOMM.2004.833833
State	Published - Aug 2004

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2004.833833

Cite this

@article{eb9cc39a28ba4a65b807cf1829032ddf,

title = "MacNeish-Mann theorem based iteratively decodable codes for optical communication systems",

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.",

author = "Djordjevic, \{Ivan B.\} and Bane Vasic",

note = "Funding Information: Manuscript received December 16, 2003. The associate editor coordinating the review of this letter and approving it for publication was Prof. C.-C. Chao. This work is supported by the National Science Foundation under Grant ITR 0325979 and Grant CCR 0208597.",

year = "2004",

month = aug,

doi = "10.1109/LCOMM.2004.833833",

language = "English (US)",

volume = "8",

pages = "538--540",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

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

AU - Djordjevic, Ivan B.

AU - Vasic, Bane

N1 - Funding Information: Manuscript received December 16, 2003. The associate editor coordinating the review of this letter and approving it for publication was Prof. C.-C. Chao. This work is supported by the National Science Foundation under Grant ITR 0325979 and Grant CCR 0208597.

PY - 2004/8

Y1 - 2004/8

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/4444360519

UR - https://www.scopus.com/pages/publications/4444360519#tab=citedBy

U2 - 10.1109/LCOMM.2004.833833

DO - 10.1109/LCOMM.2004.833833

M3 - Article

AN - SCOPUS:4444360519

SN - 1089-7798

VL - 8

SP - 538

EP - 540

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 8

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this