The analytic computability of the Shannon transform for a large class of random matrix channels

Simple item page
dc.creatorRao, N. Raj
dc.date2007-12-03
dc.date.accessioned2026-07-07T08:46:55Z
dc.date.available2026-07-07T08:46:55Z
dc.descriptionWe define a class of "algebraic" random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate the low SNR series expansion coefficients in closed form. We describe this class, the coefficient enumeration techniques and compare theory with simulations.
dc.descriptionSubmitted to the IEEE Transactions on Communications (Letters)
dc.identifierhttps://arxiv.org/abs/0712.0305
dc.identifierhttp://arxiv.org/abs/0712.0305
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143417
dc.subjectInformation Theory
dc.titleThe analytic computability of the Shannon transform for a large class of random matrix channels
dc.typetext

Files

Collections

arXiv