Asymptotics of Input-Constrained Erasure Channel Capacity

DOI10.1109/TIT.2017.2742498MaRDI QIDQ4566623zbMATH OpenOpenAlexFDO

Authors Yonglong Li, Guangyue Han

Publication date 27 June 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.02175

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formulas of its mutual information rate; and for a binary erasure channel with its first-order Markovian input supported on the $(1,infty)$-RLL constraint, based on the concavity of its mutual information rate with respect to some parameterization of the input, we numerically evaluate its first-order Markov capacity and further derive its full asymptotics. The asymptotics obtained in this paper, when compared with the recently derived feedback capacity for a binary erasure channel with the same input constraint, enable us to draw the conclusion that feedback may increase the capacity of an input-constrained channel, even if the channel is memoryless.

Cited in

(11)

• Asymptotics of input-constrained binary symmetric channel capacity
• An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback
• The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
• On Capacity Formulation With Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model
• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• $\epsilon$-Capacity of Binary Symmetric Averaged Channels
• On the Capacity of the Carbon Copy onto Dirty Paper Channel
• Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
• Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
• The Capacity of Online (Causal) q -Ary Error-Erasure Channels
• scientific article; zbMATH DE number 3412509 (Why is no real title available?)

This page was built for publication: Asymptotics of Input-Constrained Erasure Channel Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566623)