Absdet-pseudo-codewords and perm-pseudo-codewords: definitions and properties

Authors:
Roxana Smarandache;Pascal O. Vontobel
Affiliations:
Department of Mathematics and Statistics, San Diego State University, San Diego, CA;Hewlett-Packard Laboratories, Palo Alto, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 5
Cited 1

Elements of information theory

Elements of information theory
Decoding error-correcting codes via linear programming

Decoding error-correcting codes via linear programming
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes

IEEE Transactions on Information Theory
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds

IEEE Transactions on Information Theory

LP decoding meets LP decoding: a connection between channel coding and compressed sensing

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The linear-programming decoding performance of a binary linear code crucially depends on the structure of the fundamental cone of the parity-check matrix that describes the code. Towards a better understanding of fundamental cones and the vectors therein, we introduce the notion of absdet-pseudocodewords and perm-pseudo-codewords: we give the definitions, we discuss some simple examples, and we list some of their properties.