The lowest-possible BER and FER for any discrete memoryless channel with given capacity

Simple item page
dc.creatorHuber, Johannes B.
dc.creatorHehn, Thorsten
dc.date2008-01-07
dc.date2009-03-20
dc.date.accessioned2026-07-07T12:53:59Z
dc.date.available2026-07-07T12:53:59Z
dc.descriptionWe investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R>C. The results are compared to the well-known properties of a channel coding scheme leading to minimum bit error ratio. It is concluded that these two optimization requests are contradicting. A valuable application of the derived results is presented.
dc.descriptionAccepted as a Transactions on Communications Letter,9 Pages, 4 Figures
dc.identifierhttps://arxiv.org/abs/0801.1067
dc.identifierhttp://arxiv.org/abs/0801.1067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223774
dc.subjectInformation Theory
dc.titleThe lowest-possible BER and FER for any discrete memoryless channel with given capacity
dc.typetext

Files

Collections

arXiv