File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.2014.6875399
- Scopus: eid_2-s2.0-84906535619
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Input-Constrained Erasure Channels: Mutual Information and Capacity
Title | Input-Constrained Erasure Channels: Mutual Information and Capacity |
---|---|
Authors | |
Issue Date | 2014 |
Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 |
Citation | I E E E International Symposium on Information Theory (ISIT), Honolulu, USA, 29 June-4 July 4 2014. In I E E E International Symposium on Information Theory Proceedings, 2014, p. 3072-3076 How to Cite? |
Abstract | In this paper, we derive an explicit formula for the entropy rate of a hidden Markov chain, observed when the Markov chain passes through a memoryless erasure channel. This result naturally leads to an explicit formula for the mutual information rate of memoryless erasure channels with Markovian inputs. Moreover, if the input Markov chain is of first-order and supported on the (1,∞)-run length limited (RLL) constraint, we show that the mutual information rate is strictly concave with respect to a chosen parameter. Then we apply a recent algorithm [1] to approximately compute the first-order noisy constrained channel capacity and the corresponding capacity-achieving distribution. |
Persistent Identifier | http://hdl.handle.net/10722/204178 |
ISBN | |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Y | en_US |
dc.contributor.author | Han, G | en_US |
dc.date.accessioned | 2014-09-19T21:19:52Z | - |
dc.date.available | 2014-09-19T21:19:52Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.citation | I E E E International Symposium on Information Theory (ISIT), Honolulu, USA, 29 June-4 July 4 2014. In I E E E International Symposium on Information Theory Proceedings, 2014, p. 3072-3076 | en_US |
dc.identifier.isbn | 9781479951864 | - |
dc.identifier.issn | 0271-4655 | - |
dc.identifier.uri | http://hdl.handle.net/10722/204178 | - |
dc.description.abstract | In this paper, we derive an explicit formula for the entropy rate of a hidden Markov chain, observed when the Markov chain passes through a memoryless erasure channel. This result naturally leads to an explicit formula for the mutual information rate of memoryless erasure channels with Markovian inputs. Moreover, if the input Markov chain is of first-order and supported on the (1,∞)-run length limited (RLL) constraint, we show that the mutual information rate is strictly concave with respect to a chosen parameter. Then we apply a recent algorithm [1] to approximately compute the first-order noisy constrained channel capacity and the corresponding capacity-achieving distribution. | en_US |
dc.language | eng | en_US |
dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 | en_US |
dc.relation.ispartof | I E E E International Symposium on Information Theory Proceedings | en_US |
dc.title | Input-Constrained Erasure Channels: Mutual Information and Capacity | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Han, G: ghan@hku.hk | en_US |
dc.identifier.authority | Han, G=rp00702 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ISIT.2014.6875399 | en_US |
dc.identifier.scopus | eid_2-s2.0-84906535619 | - |
dc.identifier.hkuros | 237850 | en_US |
dc.identifier.spage | 3072 | en_US |
dc.identifier.epage | 3076 | en_US |
dc.publisher.place | United States | - |
dc.identifier.issnl | 0271-4655 | - |