On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

Simple item page
dc.creatorVontobel, Pascal O.
dc.creatorSmarandache, Roxana
dc.date2005-10-15
dc.date.accessioned2026-07-07T08:17:53Z
dc.date.available2026-07-07T08:17:53Z
dc.descriptionWe would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner graphs, on one hand, and study the structure of minimal pseudo-codewords, on the other.
dc.descriptionThis paper is a slightly reformulated version of the paper that appeared in the proceedings of the 43rd Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-30, 2005
dc.identifierhttps://arxiv.org/abs/cs/0510043
dc.identifierhttp://arxiv.org/abs/cs/0510043
dc.identifierProc. 43rd Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sept. 28-30, 2005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134244
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleOn Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
dc.typetext

Files

Collections

arXiv