On the Pseudocodeword Redundancy

Details On the Pseudocodeword Redundancy On the Pseudocodeword Redundancy

2010-01-11

arxiv.org/abs/1001.1705v1

Computer Science

Information Theory

5 pages

Scientific paper

We define the AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code as the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance. We show that most codes do not have a finite pseudocodeword redundancy. We also provide bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719277