{"title":"Asymptotic capacity of a random channel","authors":"Tobias Sutter, David Sutter, J. Lygeros","doi":"10.3934/amc.2017060","DOIUrl":null,"url":null,"abstract":"We consider discrete memoryless channels with input and output alphabet size n whose channel transition matrix consists of entries that are independent and identically distributed according to some probability distribution v on (R≥0, B(R≥0)) before being normalized, where v is such that E[X log X)<sup>2</sup> 1 <; ∞, μ<sub>1</sub> := E[X] and μ<sub>2</sub> := E[X log X] for a random variable X with distribution v. We prove that in the limit as n → ∞, the capacity of such a channel converges to μ<sub>2</sub>/μ<sub>1</sub> - log μ<sub>1</sub> almost surely and in L<sup>2</sup>. We further show that the capacity of these random channels converges to this asymptotic value exponentially in n.","PeriodicalId":330880,"journal":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/amc.2017060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We consider discrete memoryless channels with input and output alphabet size n whose channel transition matrix consists of entries that are independent and identically distributed according to some probability distribution v on (R≥0, B(R≥0)) before being normalized, where v is such that E[X log X)2 1 <; ∞, μ1 := E[X] and μ2 := E[X log X] for a random variable X with distribution v. We prove that in the limit as n → ∞, the capacity of such a channel converges to μ2/μ1 - log μ1 almost surely and in L2. We further show that the capacity of these random channels converges to this asymptotic value exponentially in n.