Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Designs Codes and Cryptography

Pseudocodeword-free criterion for codes with cycle-free Tanner graph

Wittawat Kositwattanarerk

Published Mar 23, 2018• 0 citations
Publisher
DOI
10.1007/s10623-018-0476-3

Related papers

On the Effective Weights of Pseudocodewords for Codes Defined on Graphs with Cycles

G. David Forney, R. Koetter, Frank R. Kschischang +1 more

The IMA volumes in mathematics and its applications•Jan 1, 2001•120 citations

Low density parity check lattices based on construction D' and cycle-free Tanner graphs.

Mohammad‐Reza Sadeghi, Daniel Panario

•Jan 1, 2003•9 citations

Low density parity check lattices based on construction 𝐷′ and cycle-free Tanner graphs

Mohammad Ali Sadeghi, Daniel Panario

DIMACS series in discrete mathematics and theoretical computer science•Jul 19, 2005•3 citations

A Study on Removing Four-Cycle in Tanner Graph for Convolutional Codes(2)

Maekawa Naoki, Toshiyuki Shohon

Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference•Aug 25, 2015•0 citations

Pseudocodeword-Free Criterion for Codes with Cycle-Free Tanner Graph

Wittawat Kositwattanarerk

Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effect on error performance as long as they are a part of redundant rows. Specifically, we characterize all parity-check matrices that are pseudocodeword-free for such class of codes.

arXiv:1706.06648•Jun 20, 2017•0 citations

On Tanner Codes: Minimum Distance and Decoding

Heeralal Janwa, Arbind Kumar Lal

Applicable Algebra in Engineering Communication and Computing•Feb 1, 2003•25 citations
Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effect on error performance as long as they are a part of redundant rows. Specifically, we characterize all parity-check matrices that are pseudocodeword-free for such class of codes.