On the Pseudocodeword Redundancy
Information Theory
2010-01-12 v1 math.IT
Abstract
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.
Cite
@article{arxiv.1001.1705,
title = {On the Pseudocodeword Redundancy},
author = {Jens Zumbragel and Mark F. Flanagan and Vitaly Skachek},
journal= {arXiv preprint arXiv:1001.1705},
year = {2010}
}
Comments
5 pages