Exploration of AWGNC and BSC Pseudocodeword Redundancy

Details Exploration of AWGNC and BSC Pseudocodeword Redundancy Exploration of AWGNC and BSC Pseudocodeword Redundancy

2010-05-19

arxiv.org/abs/1005.3486v1

Computer Science

Information Theory

7 pages

Scientific paper

The AWGNC, BSC, and max-fractional pseudocodeword redundancy of a code is defined as 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. This paper provides new results on the AWGNC, BSC, and max-fractional pseudocodeword redundancies of codes. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Also, 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

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480155