Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties
Information Theory
2016-11-15 v1 Discrete Mathematics
math.IT
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
Cite
@article{arxiv.0904.2022,
title = {Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties},
author = {Roxana Smarandache and Pascal O. Vontobel},
journal= {arXiv preprint arXiv:0904.2022},
year = {2016}
}