2000 character limit reached
Capacity of Random Channels with Large Alphabets
Published 13 Mar 2015 in cs.IT, math.IT, and math.OC | (1503.04108v3)
Abstract: We consider discrete memoryless channels with input alphabet size and output alphabet size , where ceil for some constant . The channel transition matrix consists of entries that, before being normalised, are independent and identically distributed nonnegative random variables and such that . We prove that in the limit as the capacity of such a channel converges to almost surely and in , where denotes the entropy of . We further show that, under slightly different model assumptions, the capacity of these random channels converges to this asymptotic value exponentially in . Finally, we present an application in the context of Bayesian optimal experiment design.
Paper Prompts
Sign up for free to create and run prompts on this paper.