On Bounds for $E$-capacity of DMC

Simple item page
dc.creatorHaroutunian, Evgueni A.
dc.date2006-10-23
dc.date.accessioned2026-07-07T08:16:46Z
dc.date.available2026-07-07T08:16:46Z
dc.descriptionRandom coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for $E$-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is attainable by each of the three rules, but the expurgated bound is achievable only by maximum-likelihood decoding. Sphere packing bound is obtained by very simple combinatorial reasonings of the method of types. The paper joins and reviews the results of previous hard achievable publications.
dc.identifierhttps://arxiv.org/abs/cs/0610130
dc.identifierhttp://arxiv.org/abs/cs/0610130
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133895
dc.subjectInformation Theory
dc.titleOn Bounds for $E$-capacity of DMC
dc.typetext

Files

Collections

arXiv