File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.2019.8849433
- Scopus: eid_2-s2.0-85073155003
- WOS: WOS:000489100301198
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: A Deterministic Algorithm for the Capacity of Finite-State Channels
| Title | A Deterministic Algorithm for the Capacity of Finite-State Channels |
|---|---|
| Authors | |
| Issue Date | 2019 |
| Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 |
| Citation | The 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 7-12 July 2019, p. 1897-1901 How to Cite? |
| Abstract | We propose a modified version of the classical gradient descent method to compute the capacity of finite-state channels with Markovian input. Under some concavity assumptions, our algorithm proves to achieve polynomial accuracy in polynomial time for general finite-state channels. Moreover, for some special families of finite-state channels, our algorithm can achieve exponential accuracy in polynomial time. |
| Persistent Identifier | http://hdl.handle.net/10722/277281 |
| ISSN | |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wu, C | - |
| dc.contributor.author | Han, G | - |
| dc.contributor.author | Marcus, B | - |
| dc.date.accessioned | 2019-09-20T08:48:02Z | - |
| dc.date.available | 2019-09-20T08:48:02Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | The 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 7-12 July 2019, p. 1897-1901 | - |
| dc.identifier.issn | 0271-4655 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/277281 | - |
| dc.description.abstract | We propose a modified version of the classical gradient descent method to compute the capacity of finite-state channels with Markovian input. Under some concavity assumptions, our algorithm proves to achieve polynomial accuracy in polynomial time for general finite-state channels. Moreover, for some special families of finite-state channels, our algorithm can achieve exponential accuracy in polynomial time. | - |
| dc.language | eng | - |
| dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369 | - |
| dc.relation.ispartof | IEEE International Symposium on Information Theory (ISIT) Proceedings | - |
| dc.rights | IEEE International Symposium on Information Theory (ISIT) Proceedings. Copyright © I E E E. | - |
| dc.rights | ©2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
| dc.title | A Deterministic Algorithm for the Capacity of Finite-State Channels | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Han, G: ghan@hku.hk | - |
| dc.identifier.authority | Han, G=rp00702 | - |
| dc.identifier.doi | 10.1109/ISIT.2019.8849433 | - |
| dc.identifier.scopus | eid_2-s2.0-85073155003 | - |
| dc.identifier.hkuros | 305689 | - |
| dc.identifier.spage | 1897 | - |
| dc.identifier.epage | 1901 | - |
| dc.identifier.isi | WOS:000489100301198 | - |
| dc.publisher.place | United States | - |
| dc.identifier.issnl | 0271-4655 | - |