Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

Details Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

2005-10-17

arxiv.org/abs/cs/0510049v1

Computer Science

Information Theory

12 pages 1 figure, submitted

Scientific paper

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding and linear programming decoding, respectively. The main results of this paper consist of upper and lower bounds on the pseudo-weight of the minimal pseudo-codewords of type-I PG-LDPC codes.

Affiliated with

Also associated with

No associations

Rating

Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes 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 Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228739