On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

Details On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

2005-10-15

arxiv.org/abs/cs/0510043v1

Proc. 43rd Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-

Computer Science

Information Theory

This paper is a slightly reformulated version of the paper that appeared in the proceedings of the 43rd Allerton Conference on

Scientific paper

We would like to better understand the fundamental cone of Tanner graphs
derived from finite projective planes. Towards this goal, we discuss bounds on
the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner
graphs, on one hand, and study the structure of minimal pseudo-codewords, on
the other.

Affiliated with

Also associated with

No associations

Rating

On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes 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 On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601209