Relaxation bounds on the minimum pseudo-weight of linear block codes

@article{Chaichanavong2005RelaxationBO,
  title={Relaxation bounds on the minimum pseudo-weight of linear block codes},
  author={Panu Chaichanavong and Paul H. Siegel},
  journal={Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.},
  year={2005},
  pages={805-809}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Convex optimization

  • S. Boyd, L. Vandenberghe
  • Cambridge University Press
  • 2004
1 Excerpt

A class of group - structured ldpc codes

  • D. Sridhara R. M. Tanner, T. Fuja
  • 2001

and T

  • R. M. Tanner, D. Sridhara
  • Fuja, “A class of group-s tructured ldpc codes…
  • 2001
1 Excerpt

nik, “On the effective weights of pseudocodewords for codes defined on gr aphs with cycles,” inCodes, systems, and graphical models

  • G. D. Forney, R. Koetter, F. R. Kschischang, A. Rez
  • 2001
3 Excerpts

Orthogonal Sets and Polar Methods in Linear Algebra

  • E. Castillo, A. Cobo, F. Jubete, R. E. Pruneda
  • New York: Wiley
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…