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

Research output: Contribution to journalArticle

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

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'MacNeish-Mann theorem based iteratively decodable codes for optical communication systems'. Together they form a unique fingerprint.

  • Cite this