Computer Science – Information Theory
Scientific paper
2011-12-20
Computer Science
Information Theory
Scientific paper
It was recently conjectured that a vector with components equal to the Bethe permanent of certain submatrices of a parity-check matrix is a pseudocodeword. In this paper we prove a stronger version of this conjecture and investigate the families of pseudocodewords obtained by using the Bethe permanent in two particular cases. We also highlight some interesting properties of the permanent of block matrices and their effects on pseudocodewords.
No associations
LandOfFree
Pseudocodewords from Bethe Permanents does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Pseudocodewords from Bethe Permanents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudocodewords from Bethe Permanents will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-55990