Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes

Details Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes

2005-08-07

arxiv.org/abs/cs/0508046v1

Computer Science

Information Theory

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

Just as the Hamming weight spectrum of a linear block code sheds light on the performance of a maximum likelihood decoder, the pseudo-weight spectrum provides insight into the performance of a linear programming decoder. Using properties of polyhedral cones, we find the pseudo-weight spectrum of some short codes. We also present two general lower bounds on the minimum pseudo-weight. The first bound is based on the column weight of the parity-check matrix. The second bound is computed by solving an optimization problem. In some cases, this bound is more tractable to compute than previously known bounds and thus can be applied to longer codes.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619212