Analysis of the cycle-structure of LDPC codes based on Latin squares

Olgica Milenkovic, Stefan Laendner

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, we introduce a family of structured low-density parity-check (LDPC) codes based on a class of idempotent, symmetric Latin and modified Latin squares. The parity-check matrices of the codes have a block structure with permutation blocks which insures that both their corresponding girth and minimum distance are at least equal to six. The storage requirement for codes from this class is reduced to only one parameter. We also propose a structured method for shortening the codes by removing columns that break a large number of cycles of length six. The storage requirements for the codes obtained using the described procedure consist in memorizing only two integers, while their performance under iterative decoding matches that of random-like codes of comparable length.

Original languageEnglish (US)
Pages (from-to)777-781
Number of pages5
JournalIEEE International Conference on Communications
Volume2
StatePublished - Aug 30 2004
Externally publishedYes
Event2004 IEEE International Conference on Communications - Paris, France
Duration: Jun 20 2004Jun 24 2004

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Analysis of the cycle-structure of LDPC codes based on Latin squares'. Together they form a unique fingerprint.

Cite this