Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN

Simple item page
dc.creatorSkachek, Vitaly
dc.creatorFlanagan, Mark F.
dc.date2008-03-26
dc.date2008-06-12
dc.date.accessioned2026-07-07T09:43:53Z
dc.date.available2026-07-07T09:43:53Z
dc.descriptionWe present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.
dc.description6 pages, Proceedings 5-th International Symposium on Turbo Codes & related topics
dc.identifierhttps://arxiv.org/abs/0803.3777
dc.identifierhttp://arxiv.org/abs/0803.3777
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162679
dc.subjectInformation Theory
dc.titleLower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary PSK Modulation over AWGN
dc.typetext

Files

Collections

arXiv