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.

Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

På svenska

Author

Summary, in English

The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.

Publishing year

2011

Language

English

Publication/Series

[Host publication title missing]

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory, 2011

Conference date

2011-07-31 - 2011-08-05

Conference place

Saint Petersburg, Russian Federation

Status

Published

Research group

  • Information Theory