Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties
Smarandache, R.
Vontobel, P.O.
Dept. of Math. & Stat., San Diego State Univ., San Diego, CA, USA;
This paper appears in: Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Publication Date: June 28 2009-July 3 2009
On page(s): 229-233
Location: Seoul,
ISBN: 978-1-4244-4312-3
INSPEC Accession Number: 10842428
Digital Object Identifier: 10.1109/ISIT.2009.5205910
Current Version Published: 2009-08-18
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-pseudo-codewords and perm-pseudo-codewords: we give the definitions, we discuss some simple examples, and we list some of their properties.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
