Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Simple item page
dc.creatorTwitto, M.
dc.creatorSason, I.
dc.creatorShamai, S.
dc.date2006-07-02
dc.date.accessioned2026-07-07T08:16:37Z
dc.date.available2026-07-07T08:16:37Z
dc.descriptionThe performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the AWGN channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds.
dc.descriptionSubmitted to the IEEE Trans. on Information Theory (as a correspondence), February 2006
dc.identifierhttps://arxiv.org/abs/cs/0607003
dc.identifierhttp://arxiv.org/abs/cs/0607003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133839
dc.subjectInformation Theory
dc.titleTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
dc.typetext

Files

Collections

arXiv