File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Asymptotics of input-constrained binary symmetric channel capacity

TitleAsymptotics of input-constrained binary symmetric channel capacity
Authors
Han, GMarcus, B
KeywordsConstrained capacity
Entropy
Hidden Markov chain
Issue Date2009
PublisherInstitute of Mathematical Statistics.
Citation
Annals of Applied Probability, 2009, v. 19 n. 3, p. 1063-1091 How to Cite?
DOI: http://dx.doi.org/10.1214/08-AAP570
AbstractWe study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117-122], we derive an asymptotic formula (when the noise parameter is small) for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a BSC. Using this result, we establish an asymptotic formula for the capacity of a BSC with input process supported on an irreducible finite type constraint, as the noise parameter tends to zero. © Institute of Mathematical Statistics, 2009.
Persistent Identifierhttp://hdl.handle.net/10722/58965
ISSN
1050-5164
2023 Impact Factor: 1.4
2023 SCImago Journal Rankings: 1.620
ISI Accession Number ID
WOS:000283528900007
Funding AgencyGrant Number
University of Hong Kong200709159007
Research Grants Council of the Hong Kong Special Administrative Region, ChinaHKU 701708P
Funding Information:

Supported by the University of Hong Kong under Grant No. 200709159007 and supported by the Research Grants Council of the Hong Kong Special Administrative Region, China under Grant No. HKU 701708P.

References
References in Scopus
Grants
Entropy Rate of Hidden Markov Chains

 

DC FieldValueLanguage
dc.contributor.authorHan, Gen_HK
dc.contributor.authorMarcus, Ben_HK
dc.date.accessioned2010-05-31T03:40:29Z-
dc.date.available2010-05-31T03:40:29Z-
dc.date.issued2009en_HK
dc.identifier.citationAnnals of Applied Probability, 2009, v. 19 n. 3, p. 1063-1091en_HK
dc.identifier.issn1050-5164en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58965-
dc.description.abstractWe study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117-122], we derive an asymptotic formula (when the noise parameter is small) for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a BSC. Using this result, we establish an asymptotic formula for the capacity of a BSC with input process supported on an irreducible finite type constraint, as the noise parameter tends to zero. © Institute of Mathematical Statistics, 2009.en_HK
dc.languageengen_HK
dc.publisherInstitute of Mathematical Statistics.en_HK
dc.relation.ispartofAnnals of Applied Probabilityen_HK
dc.rights© Institute of Mathematical Statistics, 2009. This article is available online at https://doi.org/10.1214/08-AAP570-
dc.subjectConstrained capacityen_HK
dc.subjectEntropyen_HK
dc.subjectHidden Markov chainen_HK
dc.titleAsymptotics of input-constrained binary symmetric channel capacityen_HK
dc.typeArticleen_HK
dc.identifier.emailHan, G:ghan@hku.hken_HK
dc.identifier.authorityHan, G=rp00702en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1214/08-AAP570en_HK
dc.identifier.scopuseid_2-s2.0-69149084960en_HK
dc.identifier.hkuros156617en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-69149084960&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume19en_HK
dc.identifier.issue3en_HK
dc.identifier.spage1063en_HK
dc.identifier.epage1091en_HK
dc.identifier.eissn2168-8737-
dc.identifier.isiWOS:000283528900007-
dc.publisher.placeUnited Statesen_HK
dc.relation.projectEntropy Rate of Hidden Markov Chains-
dc.identifier.scopusauthoridHan, G=8640067800en_HK
dc.identifier.scopusauthoridMarcus, B=7102086378en_HK
dc.identifier.issnl1050-5164-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats