On the Pseudocodeword Redundancy of Binary Linear Codes

Details On the Pseudocodeword Redundancy of Binary Linear Codes On the Pseudocodeword Redundancy of Binary Linear Codes

2011-03-18

arxiv.org/abs/1103.3641v2

Computer Science

Information Theory

14 pages. arXiv admin note: substantial text overlap with arXiv:1005.3486

Scientific paper

The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.

Affiliated with

Also associated with

No associations

Rating

On the Pseudocodeword Redundancy of Binary Linear 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 On the Pseudocodeword Redundancy of Binary Linear Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Pseudocodeword Redundancy of Binary Linear Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185383