Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

Simple item page
dc.creatorSmarandache, Roxana
dc.creatorWauer, Marcel
dc.date2005-10-17
dc.date.accessioned2026-07-07T08:15:42Z
dc.date.available2026-07-07T08:15:42Z
dc.descriptionIn this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding and linear programming decoding, respectively. The main results of this paper consist of upper and lower bounds on the pseudo-weight of the minimal pseudo-codewords of type-I PG-LDPC codes.
dc.description12 pages 1 figure, submitted
dc.identifierhttps://arxiv.org/abs/cs/0510049
dc.identifierhttp://arxiv.org/abs/cs/0510049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133533
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleBounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes
dc.typetext

Files

Collections

arXiv