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

Research output: Contribution to journalArticle

29 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)538-540
Number of pages3
JournalIEEE Communications Letters
Volume8
Issue number8
DOIs
StatePublished - Aug 2004

Fingerprint

Reed-Solomon codes
Forward error correction
Turbo codes
Optical Communication
Optical communication
Optical System
Communication Systems
Communication systems
Mutually Orthogonal Latin Squares
Turbo Codes
Reed-Solomon Codes
Low-density Parity-check (LDPC) Codes
Girth
Error Correction
Minimum Distance
Theorem
Family

ASJC Scopus subject areas

  • Computer Networks and Communications

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 Vasic, {Bane V}",
year = "2004",
month = "8",
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 V

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 - http://www.scopus.com/inward/record.url?scp=4444360519&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4444360519&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2004.833833

DO - 10.1109/LCOMM.2004.833833

M3 - Article

AN - SCOPUS:4444360519

VL - 8

SP - 538

EP - 540

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 8

ER -