Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth

DOI10.1109/TIT.2011.2176717zbMath1365.94537arXiv1108.0840MaRDI QIDQ5272010

F. Hug, R. V. Satyukov, Boris D. Kudryashov, Rolf Johannesson, Irina E. Bocharova

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.0840

Mathematics Subject Classification ID

Applications of graph theory (05C90) Convolutional codes (94B10)

Related Items (5)

A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 ⋮ QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ Counting short cycles of (c,d)-regular bipartite graphs ⋮ 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION

This page was built for publication: Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth