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

Author

Smarandache, Roxana ; Vontobel, Pascal O.

Author_Institution

Dept. of Math. & Stat., San Diego State Univ., San Diego, CA, USA

fYear

2009

fDate

June 28 2009-July 3 2009

Firstpage

229

Lastpage

233

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.

Keywords

binary codes; graph theory; iterative decoding; linear codes; linear programming; matrix algebra; message passing; parity check codes; Tanner graph; absdet-pseudo-codeword; binary linear code; fundamental cone; linear-programming decoding performance; message-passing iterative decoding; parity-check matrix; perm-pseudo-codeword; Hamming distance; Hamming weight; Iterative decoding; Laboratories; Linear code; Mathematics; Milling machines; Parity check codes; Statistics; Vectors; Absdet-pseudo-codeword; Tanner graph; fundamental cone; low-density parity-check code; message-passing iterative decoding; perm-pseudo-codeword; pseudo-codeword;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Conference_Location

Seoul

Print_ISBN

978-1-4244-4312-3

Electronic_ISBN

978-1-4244-4313-0

Type

conf

DOI

10.1109/ISIT.2009.5205910

Filename

5205910