On Bounds for $E$-capacity of DMC
نویسنده
چکیده
–Random 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.
منابع مشابه
No input symbol should occur more frequently than 1-1/e
Consider any discrete memoryless channel (DMC) with arbitrarily but finite input and output alphabets X , Y respectively. Then, for any capacity achieving input distribution all symbols occur less frequently than 1 − 1 e . That is, max x∈X P (x) < 1− 1 e where P ∗(x) is a capacity achieving input distribution. Also, we provide sufficient conditions for which a discrete distribution can be a cap...
متن کاملThreshold based Stochastic Resonance for the Binary-Input Ternary-Output Discrete Memoryless Channels
In this paper, we discuss the Stochastic Resonance (SR) effect for the binary-input ternary-output (2,3) Discrete Memoryless Channels (DMC). The (2,3) DMC is of great interest for various digital communications channels, including acoustic underwater communication. We focus on the capacity maximization, brought about by additive Gaussian noise, for the (2,3) DMCs. We analyze the capacity of the...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملThe Connected Detour Monophonic Number of a Graph
For a connected graph G = (V,E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P . A path P is called a monophonic path if it is a chordless path. A longest x− y monophonic path is called an x− y detour monophonic path. A set S of vertices of G is a detour monophonic set of G if each vertex v of G lies on an x − y detour monophonic path, for some x an...
متن کاملتهیه الکترود یون‌گزین بر پایه پلی وینیل کلرید برای اندازه‌گیری دی‌متیل آمینو اتیل‌کلراید هیدروکلراید
Dimethyl amino ethyl chloride hydrochloride (DMC) is a primary material of fuel of dimethyl amino ethyl azide (DMAZ) that is a good alternative for hydrazine derivatives in the aerospace industry. Some amount of unreacted DMC remains in the wastewater in production processes of DMAZ (95% wt.) that due to toxicity and corrosion effect of DMC, determination of this compound in DMAZ waste is ine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2007