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.

Iterative decoding of generalized low-density parity-check codes

På svenska

Author

Summary, in English

A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes

Publishing year

1998

Language

English

Publication/Series

[Host publication title missing]

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

Conference name

IEEE International Symposium on Information Theory (ISIT), 1998

Conference date

1998-08-16 - 1998-08-21

Conference place

Cambridge, MA, United States

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 0-7803-5000-6