Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

From Product Codes to Structured Generalized LDPC Codes

Lentmaier, Michael LU ; Liva, Gianluigi ; Paolini, Enrico and Fettweis, Gerhard (2010) International ICST Conference on Communications and Networking in China
Abstract
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We then propose a simple construction of quasi-cyclic GLDPC codes which leads to significantly lower error floors while leaving the decoder architecture of product codes almost untouched.
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
product codes, generalized LDPC codes, GLDPC codes
host publication
2010 5th International ICST Conference on Communications and Networking in China
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
International ICST Conference on Communications and Networking in China
conference location
Beijing, China
conference dates
2010-08-25 - 2010-08-27
external identifiers
  • scopus:79851483601
ISBN
973-963-9799-97-4
language
English
LU publication?
no
id
8564879b-9b83-4458-83e5-8b6bb179ca52 (old id 3731208)
alternative location
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5684632
date added to LUP
2016-04-04 11:27:38
date last changed
2025-04-04 13:52:05
@inproceedings{8564879b-9b83-4458-83e5-8b6bb179ca52,
  abstract     = {{Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. We then propose a simple construction of quasi-cyclic GLDPC codes which leads to significantly lower error floors while leaving the decoder architecture of product codes almost untouched.}},
  author       = {{Lentmaier, Michael and Liva, Gianluigi and Paolini, Enrico and Fettweis, Gerhard}},
  booktitle    = {{2010 5th International ICST Conference on Communications and Networking in China}},
  isbn         = {{973-963-9799-97-4}},
  keywords     = {{product codes; generalized LDPC codes; GLDPC codes}},
  language     = {{eng}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{From Product Codes to Structured Generalized LDPC Codes}},
  url          = {{https://lup.lub.lu.se/search/files/5778707/3731213.pdf}},
  year         = {{2010}},
}