Asymptotic capacity of a random channel
Asymptotic capacity of a random channel
No Thumbnail Available
Files
There are no files associated with this item.
Date
2014
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
DOI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Contribution to a conference collection
Publication status
Published
Published in
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). - Piscataway, NJ : IEEE, 2014. - pp. 771-778. - ISBN 978-1-4799-8009-3
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 L 2 . We further show that the capacity of these random channels converges to this asymptotic value exponentially in n.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
52nd Annual Allerton Conference on Communication, Control, and Computing, Sep 30, 2014 - Oct 3, 2014, Monticello, IL, USA
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
SUTTER, Tobias, David SUTTER, John LYGEROS, 2014. Asymptotic capacity of a random channel. 52nd Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, USA, Sep 30, 2014 - Oct 3, 2014. In: 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). Piscataway, NJ:IEEE, pp. 771-778. ISBN 978-1-4799-8009-3. Available under: doi: 10.1109/ALLERTON.2014.7028532BibTex
@inproceedings{Sutter2014Asymp-55741, year={2014}, doi={10.1109/ALLERTON.2014.7028532}, title={Asymptotic capacity of a random channel}, isbn={978-1-4799-8009-3}, publisher={IEEE}, address={Piscataway, NJ}, booktitle={2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)}, pages={771--778}, author={Sutter, Tobias and Sutter, David and Lygeros, John} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/55741"> <dc:creator>Sutter, David</dc:creator> <dc:creator>Lygeros, John</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Sutter, Tobias</dc:contributor> <dc:language>eng</dc:language> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dc:creator>Sutter, Tobias</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T12:55:58Z</dc:date> <dc:contributor>Lygeros, John</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:contributor>Sutter, David</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dcterms:issued>2014</dcterms:issued> <dcterms:title>Asymptotic capacity of a random channel</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T12:55:58Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55741"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
No