The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the Minimum Distance of Generalized Spatially Coupled LDPC Codes

På svenska

Author

Summary, in English

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates.

Publishing year

2013

Language

English

Pages

1874-1878

Publication/Series

IEEE International Symposium on Information Theory Proceedings (ISIT), 2013

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • LDPC codes
  • generalized LDPC codes
  • GLDPC codes
  • GLDPC convolutional codes
  • spatial coupling

Conference name

IEEE International Symposium on Information Theory, 2013

Conference date

2013-07-07 - 2013-07-12

Conference place

Istanbul, Turkey

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 2157-8095
  • ISSN: 2157-8117
  • ISBN: 9781479904440