Information Theory Jun 2009

<!DOCTYPE html> <html lang="en"> <head> <title>Information Theory Jun 2009</title> <meta name="viewport" content="width=device-width, initial-scale=1"> <link rel="apple-touch-icon" sizes="180x180" href="/static/browse/0.3.4/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/static/browse/0.3.4/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/static/browse/0.3.4/images/icons/favicon-16x16.png"> <link rel="manifest" href="/static/browse/0.3.4/images/icons/site.webmanifest"> <link rel="mask-icon" href="/static/browse/0.3.4/images/icons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="msapplication-TileColor" content="#da532c"> <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/arXiv.css?v=20241206" /> <link rel="stylesheet" type="text/css" media="print" href="/static/browse/0.3.4/css/arXiv-print.css?v=20200611" /> <link rel="stylesheet" type="text/css" media="screen" href="/static/browse/0.3.4/css/browse_search.css" /> <script language="javascript" src="/static/browse/0.3.4/js/accordion.js" /></script> <script src="/static/browse/0.3.4/js/mathjaxToggle.min.js" type="text/javascript"></script> <script type="text/javascript" language="javascript">mathjaxToggle();</script> </head> <body class="with-cu-identity"> <div class="flex-wrap-footer"> <header> <a href="#content" class="is-sr-only">Skip to main content</a>  <div class="columns is-vcentered is-hidden-mobile" id="cu-identity"> <div class="column" id="cu-logo"> <a href="https://www.cornell.edu/"><img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University" /></a> </div><div class="column" id="support-ack"> <span id="support-ack-url">We gratefully acknowledge support from the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors.</span> <a href="https://info.arxiv.org/about/donate.html" class="btn-header-donate">Donate</a> </div> </div> <div id="header" class="is-hidden-mobile"> <a aria-hidden="true" tabindex="-1" href="/IgnoreMe"></a> <div class="header-breadcrumbs"> <a href="/"><img src="/static/browse/0.3.4/images/arxiv-logo-one-color-white.svg" alt="arxiv logo" style="height:40px;"/></a> <span>></span> <a href="/list/cs.IT/recent">cs.IT</a> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div> <div class="mobile-header"> <div class="columns is-mobile"> <div class="column logo-arxiv"><a href="https://arxiv.org/"><img src="/static/browse/0.3.4/images/arxiv-logomark-small-white.svg" alt="arXiv logo" style="height:60px;" /></a></div> <div class="column logo-cornell"><a href="https://www.cornell.edu/"> <picture> <source media="(min-width: 501px)" srcset="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg 400w" sizes="400w" /> <source srcset="/static/browse/0.3.4/images/icons/cu/cornell_seal_simple_black.svg 2x" /> <img src="/static/browse/0.3.4/images/icons/cu/cornell-reduced-white-SMALL.svg" alt="Cornell University Logo" /> </picture> </a></div> <div class="column nav" id="toggle-container" role="menubar"> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-white"><title>open search</title><path d="M505 442.7L405.3 343c-4.5-4.5-10.6-7-17-7H372c27.6-35.3 44-79.7 44-128C416 93.1 322.9 0 208 0S0 93.1 0 208s93.1 208 208 208c48.3 0 92.7-16.4 128-44v16.3c0 6.4 2.5 12.5 7 17l99.7 99.7c9.4 9.4 24.6 9.4 33.9 0l28.3-28.3c9.4-9.4 9.4-24.6.1-34zM208 336c-70.7 0-128-57.2-128-128 0-70.7 57.2-128 128-128 70.7 0 128 57.2 128 128 0 70.7-57.2 128-128 128z"/></svg></button> <div class="mobile-toggle-block toggle-target"> <form class="mobile-search-form" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <input class="input" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <input type="hidden" name="source" value="header"> <input type="hidden" name="searchtype" value="all"> <button class="button">GO</button> </div> </form> </div> <button class="toggle-control"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-white" role="menu"><title>open navigation menu</title><path d="M16 132h416c8.837 0 16-7.163 16-16V76c0-8.837-7.163-16-16-16H16C7.163 60 0 67.163 0 76v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16zm0 160h416c8.837 0 16-7.163 16-16v-40c0-8.837-7.163-16-16-16H16c-8.837 0-16 7.163-16 16v40c0 8.837 7.163 16 16 16z"/ ></svg></button> <div class="mobile-toggle-block toggle-target"> <nav class="mobile-menu" aria-labelledby="mobilemenulabel"> <h2 id="mobilemenulabel">quick links</h2> <ul> <li><a href="https://arxiv.org/login">Login</a></li> <li><a href="https://info.arxiv.org/help">Help Pages</a></li> <li><a href="https://info.arxiv.org/about">About</a></li> </ul> </nav> </div> </div> </div> </div> </header> <main> <div id="content"> <div id='content-inner'> <div id='dlpage'> <h1>Information Theory</h1> <h2>Authors and titles for June 2009 </h2> <div class='paging'>Total of 97 entries : <span>1-50</span> <a href=/list/cs.IT/2009-06?skip=50&show=50>51-97</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.IT/2009-06?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.IT/2009-06?skip=0&show=2000 rel="nofollow"> all</a> </div> <dl id='articles'> <dt> <a name='item1'>[1]</a> <a href ="/abs/0906.0037" title="Abstract" id="0906.0037"> arXiv:0906.0037 </a> [<a href="/pdf/0906.0037" title="Download PDF" id="pdf-0906.0037" aria-labelledby="pdf-0906.0037">pdf</a>, <a href="/format/0906.0037" title="Other formats" id="oth-0906.0037" aria-labelledby="oth-0906.0037">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Fawaz,+N">Nadia Fawaz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zarifi,+K">Keyvan Zarifi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Debbah,+M">Merouane Debbah</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Gesbert,+D">David Gesbert</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 45 pages, 7 figures, submitted to IEEE Transactions on Information Theory, December 2008 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item2'>[2]</a> <a href ="/abs/0906.0247" title="Abstract" id="0906.0247"> arXiv:0906.0247 </a> [<a href="/pdf/0906.0247" title="Download PDF" id="pdf-0906.0247" aria-labelledby="pdf-0906.0247">pdf</a>, <a href="/format/0906.0247" title="Other formats" id="oth-0906.0247" aria-labelledby="oth-0906.0247">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Coded Modulation with Mismatched CSIT over Block-Fading Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kim,+T+T">Tung T. Kim</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Fabregas,+A+G+i">Albert Guillen i Fabregas</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to the IEEE Transactions on Information Theory. To be presented (in part) at the 2009 IEEE International Symposium on Information Theory, Seoul, South Korea, June-July 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item3'>[3]</a> <a href ="/abs/0906.0249" title="Abstract" id="0906.0249"> arXiv:0906.0249 </a> [<a href="/pdf/0906.0249" title="Download PDF" id="pdf-0906.0249" aria-labelledby="pdf-0906.0249">pdf</a>, <a href="/format/0906.0249" title="Other formats" id="oth-0906.0249" aria-labelledby="oth-0906.0249">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Faster Projection in Sphere Decoding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ghasemmehdi,+A">Arash Ghasemmehdi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Agrell,+E">Erik Agrell</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3530-3536, June 2011 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item4'>[4]</a> <a href ="/abs/0906.0298" title="Abstract" id="0906.0298"> arXiv:0906.0298 </a> [<a href="/pdf/0906.0298" title="Download PDF" id="pdf-0906.0298" aria-labelledby="pdf-0906.0298">pdf</a>, <a href="/format/0906.0298" title="Other formats" id="oth-0906.0298" aria-labelledby="oth-0906.0298">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Delay-Optimal Power and Precoder Adaptation for Multi-stream MIMO Systems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lau,+V+K+N">Vincent K. N. Lau</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Chen,+Y">Yan Chen</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Wireless Communications, June 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item5'>[5]</a> <a href ="/abs/0906.0330" title="Abstract" id="0906.0330"> arXiv:0906.0330 </a> [<a href="/pdf/0906.0330" title="Download PDF" id="pdf-0906.0330" aria-labelledby="pdf-0906.0330">pdf</a>, <a href="/format/0906.0330" title="Other formats" id="oth-0906.0330" aria-labelledby="oth-0906.0330">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Information-Theoretic Inequalities on Unimodular Lie Groups </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Chirikjian,+G+S">Gregory S. Chirikjian</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Mathematical Physics (math-ph) </div> </div> </dd> <dt> <a name='item6'>[6]</a> <a href ="/abs/0906.0550" title="Abstract" id="0906.0550"> arXiv:0906.0550 </a> [<a href="/pdf/0906.0550" title="Download PDF" id="pdf-0906.0550" aria-labelledby="pdf-0906.0550">pdf</a>, <a href="/format/0906.0550" title="Other formats" id="oth-0906.0550" aria-labelledby="oth-0906.0550">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On linear completely regular codes with covering radius $蟻=1$. Construction and classification </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zinoviev,+J+B+J+R+V">J. Borges J. Rifa V. Zinoviev</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to IEEE, Trans. Inf. Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item7'>[7]</a> <a href ="/abs/0906.0690" title="Abstract" id="0906.0690"> arXiv:0906.0690 </a> [<a href="/pdf/0906.0690" title="Download PDF" id="pdf-0906.0690" aria-labelledby="pdf-0906.0690">pdf</a>, <a href="/format/0906.0690" title="Other formats" id="oth-0906.0690" aria-labelledby="oth-0906.0690">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Thinning, Entropy and the Law of Thin Numbers </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Harremoes,+P">Peter Harremoes</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Johnson,+O">Oliver Johnson</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kontoyiannis,+I">Ioannis Kontoyiannis</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Information Theory, Vol 56/9, 2010, pages 4228-4244 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Probability (math.PR) </div> </div> </dd> <dt> <a name='item8'>[8]</a> <a href ="/abs/0906.0695" title="Abstract" id="0906.0695"> arXiv:0906.0695 </a> [<a href="/pdf/0906.0695" title="Download PDF" id="pdf-0906.0695" aria-labelledby="pdf-0906.0695">pdf</a>, <a href="/format/0906.0695" title="Other formats" id="oth-0906.0695" aria-labelledby="oth-0906.0695">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On network coding for sum-networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Rai,+B+K">Brijesh Kumar Rai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Dey,+B+K">Bikash Kumar Dey</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Accepted to IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item9'>[9]</a> <a href ="/abs/0906.0739" title="Abstract" id="0906.0739"> arXiv:0906.0739 </a> [<a href="/pdf/0906.0739" title="Download PDF" id="pdf-0906.0739" aria-labelledby="pdf-0906.0739">pdf</a>, <a href="/format/0906.0739" title="Other formats" id="oth-0906.0739" aria-labelledby="oth-0906.0739">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Spectrum Sensing in Low SNR Regime via Stochastic Resonance </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zheng,+K">Kun Zheng</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+H">Husheng Li</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Djouadi,+S+M">Seddik M. Djouadi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+J">Jun Wang</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 5 pages, 9 figures, submitted to Asilomar 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item10'>[10]</a> <a href ="/abs/0906.0744" title="Abstract" id="0906.0744"> arXiv:0906.0744 </a> [<a href="/pdf/0906.0744" title="Download PDF" id="pdf-0906.0744" aria-labelledby="pdf-0906.0744">pdf</a>, <a href="/format/0906.0744" title="Other formats" id="oth-0906.0744" aria-labelledby="oth-0906.0744">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Ergodic Fading Interference Channels: Sum-Capacity and Separability </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Sankar,+L">Lalitha Sankar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shang,+X">Xiaohu Shang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Erkip,+E">Elza Erkip</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Poor,+H+V">H. Vincent Poor</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> accepted for publication in the IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item11'>[11]</a> <a href ="/abs/0906.0840" title="Abstract" id="0906.0840"> arXiv:0906.0840 </a> [<a href="/pdf/0906.0840" title="Download PDF" id="pdf-0906.0840" aria-labelledby="pdf-0906.0840">pdf</a>, <a href="/format/0906.0840" title="Other formats" id="oth-0906.0840" aria-labelledby="oth-0906.0840">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Soft-Input Soft-Output Single Tree-Search Sphere Decoding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Studer,+C">Christoph Studer</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=B%C3%B6lcskei,+H">Helmut B枚lcskei</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to the IEEE Trans. Inf. Theory, June 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item12'>[12]</a> <a href ="/abs/0906.0958" title="Abstract" id="0906.0958"> arXiv:0906.0958 </a> [<a href="/pdf/0906.0958" title="Download PDF" id="pdf-0906.0958" aria-labelledby="pdf-0906.0958">pdf</a>, <a href="/format/0906.0958" title="Other formats" id="oth-0906.0958" aria-labelledby="oth-0906.0958">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On a Generalized Foster-Lyapunov Type Criterion for the Stability of Multidimensional Markov chains with Applications to the Slotted-Aloha Protocol with Finite Number of Queues </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kompalli,+S+C">Sayee C. Kompalli</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Mazumdar,+R+R">Ravi R. Mazumdar</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item13'>[13]</a> <a href ="/abs/0906.0964" title="Abstract" id="0906.0964"> arXiv:0906.0964 </a> [<a href="/pdf/0906.0964" title="Download PDF" id="pdf-0906.0964" aria-labelledby="pdf-0906.0964">pdf</a>, <a href="/format/0906.0964" title="Other formats" id="oth-0906.0964" aria-labelledby="oth-0906.0964">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On Sparse Channel Estimation </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Carroll,+B">Brian Carroll</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> M.S. Thesis (106 pages, 35 figures) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item14'>[14]</a> <a href ="/abs/0906.1079" title="Abstract" id="0906.1079"> arXiv:0906.1079 </a> [<a href="/pdf/0906.1079" title="Download PDF" id="pdf-0906.1079" aria-labelledby="pdf-0906.1079">pdf</a>, <a href="/format/0906.1079" title="Other formats" id="oth-0906.1079" aria-labelledby="oth-0906.1079">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Modified Frame Reconstruction Algorithm for Compressive Sensing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Pope,+G">Graeme Pope</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item15'>[15]</a> <a href ="/abs/0906.1189" title="Abstract" id="0906.1189"> arXiv:0906.1189 </a> [<a href="/pdf/0906.1189" title="Download PDF" id="pdf-0906.1189" aria-labelledby="pdf-0906.1189">pdf</a>, <a href="/format/0906.1189" title="Other formats" id="oth-0906.1189" aria-labelledby="oth-0906.1189">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Throughput/Bit-Cost Tradeoff in CSMA Based Cooperative Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=B%C3%B6cherer,+G">Georg B枚cherer</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 6 pages. To be presented at SCC 2010 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item16'>[16]</a> <a href ="/abs/0906.1244" title="Abstract" id="0906.1244"> arXiv:0906.1244 </a> [<a href="/pdf/0906.1244" title="Download PDF" id="pdf-0906.1244" aria-labelledby="pdf-0906.1244">pdf</a>, <a href="/format/0906.1244" title="Other formats" id="oth-0906.1244" aria-labelledby="oth-0906.1244">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Generalised Pinsker Inequalities </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Reid,+M+D">Mark D. Reid</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Williamson,+R+C">Robert C. Williamson</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 21 pages, 3 figures, accepted to COLT 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item17'>[17]</a> <a href ="/abs/0906.1339" title="Abstract" id="0906.1339"> arXiv:0906.1339 </a> [<a href="/pdf/0906.1339" title="Download PDF" id="pdf-0906.1339" aria-labelledby="pdf-0906.1339">pdf</a>, <a href="/format/0906.1339" title="Other formats" id="oth-0906.1339" aria-labelledby="oth-0906.1339">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Error Exponents for Broadcast Channels with Degraded Message Sets </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kaspi,+Y">Yonatan Kaspi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Merhav,+N">Neri Merhav</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item18'>[18]</a> <a href ="/abs/0906.1360" title="Abstract" id="0906.1360"> arXiv:0906.1360 </a> [<a href="/pdf/0906.1360" title="Download PDF" id="pdf-0906.1360" aria-labelledby="pdf-0906.1360">pdf</a>, <a href="/format/0906.1360" title="Other formats" id="oth-0906.1360" aria-labelledby="oth-0906.1360">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the effectiveness of a binless entropy estimator for generalised entropic forms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Queiros,+S+M+D">Silvio M. Duarte Queiros</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 10 pages. 5 Figures. 2 Appendices with 2 figures </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Phys. Rev. E 80, 062101 (2009) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Data Structures and Algorithms (cs.DS); Numerical Analysis (math.NA) </div> </div> </dd> <dt> <a name='item19'>[19]</a> <a href ="/abs/0906.1487" title="Abstract" id="0906.1487"> arXiv:0906.1487 </a> [<a href="/pdf/0906.1487" title="Download PDF" id="pdf-0906.1487" aria-labelledby="pdf-0906.1487">pdf</a>, <a href="/format/0906.1487" title="Other formats" id="oth-0906.1487" aria-labelledby="oth-0906.1487">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> The Physics of Compressive Sensing and the Gradient-Based Recovery Algorithms </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Dai,+Q">Qi Dai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sha,+W">Wei Sha</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, 11 Figures. It is a research report which has not been published in any Journal or Conference </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item20'>[20]</a> <a href ="/abs/0906.1538" title="Abstract" id="0906.1538"> arXiv:0906.1538 </a> [<a href="/pdf/0906.1538" title="Download PDF" id="pdf-0906.1538" aria-labelledby="pdf-0906.1538">pdf</a>, <a href="/format/0906.1538" title="Other formats" id="oth-0906.1538" aria-labelledby="oth-0906.1538">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes" </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ayanoglu,+E">Ender Ayanoglu</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item21'>[21]</a> <a href ="/abs/0906.1565" title="Abstract" id="0906.1565"> arXiv:0906.1565 </a> [<a href="/pdf/0906.1565" title="Download PDF" id="pdf-0906.1565" aria-labelledby="pdf-0906.1565">pdf</a>, <a href="/format/0906.1565" title="Other formats" id="oth-0906.1565" aria-labelledby="oth-0906.1565">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Skachek,+V">Vitaly Skachek</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Part of this work was presented at the IEEE International Symposium on Information Theory 2009, Seoul, Korea </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item22'>[22]</a> <a href ="/abs/0906.1599" title="Abstract" id="0906.1599"> arXiv:0906.1599 </a> [<a href="/pdf/0906.1599" title="Download PDF" id="pdf-0906.1599" aria-labelledby="pdf-0906.1599">pdf</a>, <a href="/format/0906.1599" title="Other formats" id="oth-0906.1599" aria-labelledby="oth-0906.1599">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bits Through Deterministic Relay Cascades with Half-Duplex Constraint </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lutz,+T">Tobias Lutz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Hausl,+C">Christoph Hausl</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=K%C3%B6tter,+R">Ralf K枚tter</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> accepted for publication in IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item23'>[23]</a> <a href ="/abs/0906.1603" title="Abstract" id="0906.1603"> arXiv:0906.1603 </a> [<a href="/pdf/0906.1603" title="Download PDF" id="pdf-0906.1603" aria-labelledby="pdf-0906.1603">pdf</a>, <a href="/format/0906.1603" title="Other formats" id="oth-0906.1603" aria-labelledby="oth-0906.1603">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Zaidi,+A">Abdellatif Zaidi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kotagiri,+S+P">Shiva Prasad Kotagiri</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Laneman,+J+N">J. Nicholas Laneman</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vandendorpe,+L">Luc Vandendorpe</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 5 pages, Proc. of IEEE International Symposium on Information theory, ISIT 2009, Seoul, Korea </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item24'>[24]</a> <a href ="/abs/0906.1618" title="Abstract" id="0906.1618"> arXiv:0906.1618 </a> [<a href="/pdf/0906.1618" title="Download PDF" id="pdf-0906.1618" aria-labelledby="pdf-0906.1618">pdf</a>, <a href="/format/0906.1618" title="Other formats" id="oth-0906.1618" aria-labelledby="oth-0906.1618">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Statistics of Cognitive Radio Capacity in Shadowing and Fast Fading Environments (Journal Version) </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Hanif,+M+F">Muhammad Fainan Hanif</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Smith,+P+J">Peter J. Smith</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to the IEEE Transactions on Wireless Commun. The conference version of this paper appears in Proc. IEEE CrownCom, 2009 </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Transactions on Wireless Communications, vol.9, no.2, pp.844-852, 2010 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item25'>[25]</a> <a href ="/abs/0906.1677" title="Abstract" id="0906.1677"> arXiv:0906.1677 </a> [<a href="/pdf/0906.1677" title="Download PDF" id="pdf-0906.1677" aria-labelledby="pdf-0906.1677">pdf</a>, <a href="/format/0906.1677" title="Other formats" id="oth-0906.1677" aria-labelledby="oth-0906.1677">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Outage Behavior of Discrete Memoryless Channels (DMCs) Under Channel Estimation Errors </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Piantanida,+P">Pablo Piantanida</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Matz,+G">Gerald Matz</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Duhamel,+P">Pierre Duhamel</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in IEEE Transactions on Information Theory, Sep. 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Discrete Mathematics (cs.DM) </div> </div> </dd> <dt> <a name='item26'>[26]</a> <a href ="/abs/0906.1835" title="Abstract" id="0906.1835"> arXiv:0906.1835 </a> [<a href="/pdf/0906.1835" title="Download PDF" id="pdf-0906.1835" aria-labelledby="pdf-0906.1835">pdf</a>, <a href="/format/0906.1835" title="Other formats" id="oth-0906.1835" aria-labelledby="oth-0906.1835">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Secret-Key Generation using Correlated Sources and Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Khisti,+A">Ashish Khisti</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Diggavi,+S">Suhas Diggavi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Wornell,+G">Gregory Wornell</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 29 Pages, Submitted IEEE Trans. Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Cryptography and Security (cs.CR) </div> </div> </dd> <dt> <a name='item27'>[27]</a> <a href ="/abs/0906.2032" title="Abstract" id="0906.2032"> arXiv:0906.2032 </a> [<a href="/pdf/0906.2032" title="Download PDF" id="pdf-0906.2032" aria-labelledby="pdf-0906.2032">pdf</a>, <a href="/format/0906.2032" title="Other formats" id="oth-0906.2032" aria-labelledby="oth-0906.2032">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Mapping Equivalence for Symbolic Sequences: Theory and Applications </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Wang,+L">Liming Wang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schonfeld,+D">Dan Schonfeld</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Functional Analysis (math.FA); Numerical Analysis (math.NA) </div> </div> </dd> <dt> <a name='item28'>[28]</a> <a href ="/abs/0906.2061" title="Abstract" id="0906.2061"> arXiv:0906.2061 </a> [<a href="/pdf/0906.2061" title="Download PDF" id="pdf-0906.2061" aria-labelledby="pdf-0906.2061">pdf</a>, <a href="/format/0906.2061" title="Other formats" id="oth-0906.2061" aria-labelledby="oth-0906.2061">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Minimum Distance of Non Binary LDPC Codes </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Pulikkoonattu,+R">Rethnakaran Pulikkoonattu</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Student project report LTHC, EPFL, Switzerland, Jun. 2008 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item29'>[29]</a> <a href ="/abs/0906.2252" title="Abstract" id="0906.2252"> arXiv:0906.2252 </a> [<a href="/pdf/0906.2252" title="Download PDF" id="pdf-0906.2252" aria-labelledby="pdf-0906.2252">pdf</a>, <a href="/format/0906.2252" title="Other formats" id="oth-0906.2252" aria-labelledby="oth-0906.2252">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Dirty Paper Coding for the MIMO Cognitive Radio Channel with Imperfect CSIT </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Vaze,+C+S">Chinmay S. Vaze</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Varanasi,+M+K">Mahesh K. Varanasi</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To be presented at ISIT 2009, Seoul, S. Korea </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item30'>[30]</a> <a href ="/abs/0906.2372" title="Abstract" id="0906.2372"> arXiv:0906.2372 </a> [<a href="/pdf/0906.2372" title="Download PDF" id="pdf-0906.2372" aria-labelledby="pdf-0906.2372">pdf</a>, <a href="/format/0906.2372" title="Other formats" id="oth-0906.2372" aria-labelledby="oth-0906.2372">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Bounds on the Rate of 2-D Bit-Stuffing Encoders </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Tal,+I">Ido Tal</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Roth,+R+M">Ron M. Roth</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item31'>[31]</a> <a href ="/abs/0906.2509" title="Abstract" id="0906.2509"> arXiv:0906.2509 </a> [<a href="/pdf/0906.2509" title="Download PDF" id="pdf-0906.2509" aria-labelledby="pdf-0906.2509">pdf</a>, <a href="/format/0906.2509" title="Other formats" id="oth-0906.2509" aria-labelledby="oth-0906.2509">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On $[[n,n-4,3]]_{q}$ Quantum MDS Codes for odd prime power $q$ </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Li,+R">Ruihu Li</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Xu,+Z">Zongben Xu</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, submitted to IEEE Trans. Inf. Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item32'>[32]</a> <a href ="/abs/0906.2511" title="Abstract" id="0906.2511"> arXiv:0906.2511 </a> [<a href="/pdf/0906.2511" title="Download PDF" id="pdf-0906.2511" aria-labelledby="pdf-0906.2511">pdf</a>, <a href="/format/0906.2511" title="Other formats" id="oth-0906.2511" aria-labelledby="oth-0906.2511">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Robust Rate-Adaptive Wireless Communication Using ACK/NAK-Feedback </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Koksal,+C+E">C. Emre Koksal</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Schniter,+P">Philip Schniter</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Relative to the original version, this version includes a revised introduction and a few minor technical changes </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item33'>[33]</a> <a href ="/abs/0906.2582" title="Abstract" id="0906.2582"> arXiv:0906.2582 </a> [<a href="/pdf/0906.2582" title="Download PDF" id="pdf-0906.2582" aria-labelledby="pdf-0906.2582">pdf</a>, <a href="/format/0906.2582" title="Other formats" id="oth-0906.2582" aria-labelledby="oth-0906.2582">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Watanabe,+S">Shun Watanabe</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Matsumoto,+R">Ryutaroh Matsumoto</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Uyematsu,+T">Tomohiko Uyematsu</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 10 pages, no figure, A part of this paper will be presented at 2009 IEEE International Symposium on Information Theory in Seoul, Korea. Version 2 is a published version. The results are not changed from version 1. Explanations are polished and some references are added. In version 3, only style and DOI are edited </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEICE Trans. Fundamentals, vol. 93, no. 9, pp. 1650-1659, September 2010 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item34'>[34]</a> <a href ="/abs/0906.2603" title="Abstract" id="0906.2603"> arXiv:0906.2603 </a> [<a href="/pdf/0906.2603" title="Download PDF" id="pdf-0906.2603" aria-labelledby="pdf-0906.2603">pdf</a>, <a href="/format/0906.2603" title="Other formats" id="oth-0906.2603" aria-labelledby="oth-0906.2603">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Soundararajan,+R">Rajiv Soundararajan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Vishwanath,+S">Sriram Vishwanath</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 5 pages, 1 figure, to be presented at ISIT 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item35'>[35]</a> <a href ="/abs/0906.2609" title="Abstract" id="0906.2609"> arXiv:0906.2609 </a> [<a href="/pdf/0906.2609" title="Download PDF" id="pdf-0906.2609" aria-labelledby="pdf-0906.2609">pdf</a>, <a href="/format/0906.2609" title="Other formats" id="oth-0906.2609" aria-labelledby="oth-0906.2609">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Concatenate and Boost for Multiple Measurement Vector Problems </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lee,+O+K">O. K. Lee</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ye,+J+C">J. C. Ye</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> This paper has been withdrawn by the authors due to the insufficient novelty </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item36'>[36]</a> <a href ="/abs/0906.2819" title="Abstract" id="0906.2819"> arXiv:0906.2819 </a> [<a href="/pdf/0906.2819" title="Download PDF" id="pdf-0906.2819" aria-labelledby="pdf-0906.2819">pdf</a>, <a href="/format/0906.2819" title="Other formats" id="oth-0906.2819" aria-labelledby="oth-0906.2819">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Disjoint LDPC Coding for Gaussian Broadcast Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ramezani,+M">Mahdi Ramezani</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Ardakani,+M">Masoud Ardakani</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 5 pages, 1 figure, 3 tables, To appear in Proc. IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, June-July 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item37'>[37]</a> <a href ="/abs/0906.2820" title="Abstract" id="0906.2820"> arXiv:0906.2820 </a> [<a href="/pdf/0906.2820" title="Download PDF" id="pdf-0906.2820" aria-labelledby="pdf-0906.2820">pdf</a>, <a href="/format/0906.2820" title="Other formats" id="oth-0906.2820" aria-labelledby="oth-0906.2820">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Equalization for Non-Coherent UWB Systems with Approximate Semi-Definite Programming </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ma,+X">Xudong Ma</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 7 pages, 5 figures, submitted to the 3rd International Conference on Signal Processing and Communication Systems, 28 - 30 September 2009, Omaha, Nebraska </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Proceeding of the 3rd International Conference on Signal Processing and Communication Systems, 28 - 30 September 2009, Omaha, Nebraska </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item38'>[38]</a> <a href ="/abs/0906.2864" title="Abstract" id="0906.2864"> arXiv:0906.2864 </a> [<a href="/pdf/0906.2864" title="Download PDF" id="pdf-0906.2864" aria-labelledby="pdf-0906.2864">pdf</a>, <a href="/format/0906.2864" title="Other formats" id="oth-0906.2864" aria-labelledby="oth-0906.2864">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Discussion of Twenty Questions Problem </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=You,+B">Barco You</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 2 pages, 5figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item39'>[39]</a> <a href ="/abs/0906.3173" title="Abstract" id="0906.3173"> arXiv:0906.3173 </a> [<a href="/pdf/0906.3173" title="Download PDF" id="pdf-0906.3173" aria-labelledby="pdf-0906.3173">pdf</a>, <a href="/format/0906.3173" title="Other formats" id="oth-0906.3173" aria-labelledby="oth-0906.3173">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Eldar,+Y+C">Yonina C. Eldar</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Kuppinger,+P">Patrick Kuppinger</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=B%C3%B6lcskei,+H">Helmut B枚lcskei</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> Submitted to the IEEE Trans. on Signal Processing, version 2 has updated figures </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item40'>[40]</a> <a href ="/abs/0906.3183" title="Abstract" id="0906.3183"> arXiv:0906.3183 </a> [<a href="/pdf/0906.3183" title="Download PDF" id="pdf-0906.3183" aria-labelledby="pdf-0906.3183">pdf</a>, <a href="/format/0906.3183" title="Other formats" id="oth-0906.3183" aria-labelledby="oth-0906.3183">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Approximate Characterizations for the Gaussian Source Broadcast Distortion Region </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Tian,+C">Chao Tian</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Diggavi,+S">Suhas Diggavi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shamai,+S">Shlomo Shamai</a> (Shitz)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> revised version. to appear in Trans. IT </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item41'>[41]</a> <a href ="/abs/0906.3192" title="Abstract" id="0906.3192"> arXiv:0906.3192 </a> [<a href="/pdf/0906.3192" title="Download PDF" id="pdf-0906.3192" aria-labelledby="pdf-0906.3192">pdf</a>, <a href="/format/0906.3192" title="Other formats" id="oth-0906.3192" aria-labelledby="oth-0906.3192">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Secured Communication over Frequency-Selective Fading Channels: a practical Vandermonde precoding </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kobayashi,+M">Mari Kobayashi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Debbah,+M">Merouane Debbah</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shamai,+S">Shlomo Shamai</a> (Shitz)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in EURASIP journal on Wireless Communications and Networking, special issue on Wireless Physical Security, 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item42'>[42]</a> <a href ="/abs/0906.3200" title="Abstract" id="0906.3200"> arXiv:0906.3200 </a> [<a href="/pdf/0906.3200" title="Download PDF" id="pdf-0906.3200" aria-labelledby="pdf-0906.3200">pdf</a>, <a href="/format/0906.3200" title="Other formats" id="oth-0906.3200" aria-labelledby="oth-0906.3200">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> On the Compound MIMO Broadcast Channels with Confidential Messages </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Kobayashi,+M">Mari Kobayashi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Liang,+Y">Yingbin Liang</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Shamai,+S">Shlomo Shamai</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Debbah,+M">Merouane Debbah</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To appear in Proc. IEEE Symposium on Information Theory (ISIT 2009) June 28 - July 3, 2009, Seoul, Korea </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item43'>[43]</a> <a href ="/abs/0906.3234" title="Abstract" id="0906.3234"> arXiv:0906.3234 </a> [<a href="/pdf/0906.3234" title="Download PDF" id="pdf-0906.3234" aria-labelledby="pdf-0906.3234">pdf</a>, <a href="/format/0906.3234" title="Other formats" id="oth-0906.3234" aria-labelledby="oth-0906.3234">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Rangan,+S">Sundeep Rangan</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Fletcher,+A+K">Alyson K. Fletcher</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Goyal,+V+K">Vivek K Goyal</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> 22 pages; added details on the replica symmetry assumption </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Trans. on Information Theory, vol. 58, no. 3, pp. 1903-1923, March 2012 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item44'>[44]</a> <a href ="/abs/0906.3235" title="Abstract" id="0906.3235"> arXiv:0906.3235 </a> [<a href="/pdf/0906.3235" title="Download PDF" id="pdf-0906.3235" aria-labelledby="pdf-0906.3235">pdf</a>, <a href="/format/0906.3235" title="Other formats" id="oth-0906.3235" aria-labelledby="oth-0906.3235">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Simplicity via Provability for Universal Prefix-free Turing Machines </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Calude,+C+S">Cristian S. Calude</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> EPTCS 1, 2009, pp. 16-21 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Logic in Computer Science (cs.LO) </div> </div> </dd> <dt> <a name='item45'>[45]</a> <a href ="/abs/0906.3282" title="Abstract" id="0906.3282"> arXiv:0906.3282 </a> [<a href="/pdf/0906.3282" title="Download PDF" id="pdf-0906.3282" aria-labelledby="pdf-0906.3282">pdf</a>, <a href="/format/0906.3282" title="Other formats" id="oth-0906.3282" aria-labelledby="oth-0906.3282">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Maximum Error Modeling for Fault-Tolerant Computation using Maximum a posteriori (MAP) Hypothesis </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Lingasubramanian,+K">Karthikeyan Lingasubramanian</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Alam,+S+M">Syed M. Alam</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Bhanja,+S">Sanjukta Bhanja</a></div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> Microelectronics Reliability, 2010 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item46'>[46]</a> <a href ="/abs/0906.3313" title="Abstract" id="0906.3313"> arXiv:0906.3313 </a> [<a href="/pdf/0906.3313" title="Download PDF" id="pdf-0906.3313" aria-labelledby="pdf-0906.3313">pdf</a>, <a href="/format/0906.3313" title="Other formats" id="oth-0906.3313" aria-labelledby="oth-0906.3313">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Efficient And Portable SDR Waveform Development: The Nucleus Concept </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Ramakrishnan,+V">Venkatesh Ramakrishnan</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Witte,+E+M">Ernst M. Witte</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Kempf,+T">Torsten Kempf</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Kammler,+D">David Kammler</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Ascheid,+G">Gerd Ascheid</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Meyr,+H">Heinrich Meyr</a> (1), <a href="https://arxiv.org/search/cs?searchtype=author&query=Adrat,+M">Marc Adrat</a> (2), <a href="https://arxiv.org/search/cs?searchtype=author&query=Antweiler,+M">Markus Antweiler</a> (2) ((1) Institute for Integrated Signal Processing Systems, RWTH Aachen University, Germany (2) Research Establishment for Applied Science (FGAN), Dept. FKIE/KOM, Wachtberg, Germany)</div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> To Appear in 2009 IEEE Military Communications Conference (MILCOM 2009) </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Networking and Internet Architecture (cs.NI) </div> </div> </dd> <dt> <a name='item47'>[47]</a> <a href ="/abs/0906.3352" title="Abstract" id="0906.3352"> arXiv:0906.3352 </a> [<a href="/pdf/0906.3352" title="Download PDF" id="pdf-0906.3352" aria-labelledby="pdf-0906.3352">pdf</a>, <a href="/format/0906.3352" title="Other formats" id="oth-0906.3352" aria-labelledby="oth-0906.3352">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Spreading Code and Widely-Linear Receiver Design: Non-Cooperative Games for Wireless CDMA Networks </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Buzzi,+S">Stefano Buzzi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Poor,+H+V">H. Vincent Poor</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Zappone,+A">Alessio Zappone</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to IEEE Transactions on Information Theory, June 2009 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span>; Computer Science and Game Theory (cs.GT) </div> </div> </dd> <dt> <a name='item48'>[48]</a> <a href ="/abs/0906.3410" title="Abstract" id="0906.3410"> arXiv:0906.3410 </a> [<a href="/pdf/0906.3410" title="Download PDF" id="pdf-0906.3410" aria-labelledby="pdf-0906.3410">pdf</a>, <a href="/format/0906.3410" title="Other formats" id="oth-0906.3410" aria-labelledby="oth-0906.3410">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Quasi-cyclic LDPC codes with high girth </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Spagnol,+C">Christian Spagnol</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Rossi,+M">Marta Rossi</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Sala,+M">Massimiliano Sala</a></div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item49'>[49]</a> <a href ="/abs/0906.3667" title="Abstract" id="0906.3667"> arXiv:0906.3667 </a> [<a href="/pdf/0906.3667" title="Download PDF" id="pdf-0906.3667" aria-labelledby="pdf-0906.3667">pdf</a>, <a href="/format/0906.3667" title="Other formats" id="oth-0906.3667" aria-labelledby="oth-0906.3667">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple Access Channels </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Couillet,+R">Romain Couillet</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Debbah,+M">Merouane Debbah</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Silverstein,+J+W">Jack W. Silverstein</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> to appear in IEEE Transactions on Information Theory </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> <dt> <a name='item50'>[50]</a> <a href ="/abs/0906.3682" title="Abstract" id="0906.3682"> arXiv:0906.3682 </a> [<a href="/pdf/0906.3682" title="Download PDF" id="pdf-0906.3682" aria-labelledby="pdf-0906.3682">pdf</a>, <a href="/format/0906.3682" title="Other formats" id="oth-0906.3682" aria-labelledby="oth-0906.3682">other</a>] </dt> <dd> <div class='meta'> <div class='list-title mathjax'><span class='descriptor'>Title:</span> Large System Analysis of Linear Precoding in Correlated MISO Broadcast Channels under Limited Feedback </div> <div class='list-authors'><a href="https://arxiv.org/search/cs?searchtype=author&query=Wagner,+S">Sebastian Wagner</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Couillet,+R">Romain Couillet</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Debbah,+M">Merouane Debbah</a>, <a href="https://arxiv.org/search/cs?searchtype=author&query=Slock,+D+T+M">Dirk. T. M. Slock</a></div> <div class='list-comments mathjax'><span class='descriptor'>Comments:</span> submitted to IEEE Transactions on Information Theory </div> <div class='list-journal-ref'><span class='descriptor'>Journal-ref:</span> IEEE Trans. Inf. Theory, vol. 58, no. 7, pp. 4509 - 4537, Jul. 2012 </div> <div class='list-subjects'><span class='descriptor'>Subjects:</span> <span class="primary-subject">Information Theory (cs.IT)</span> </div> </div> </dd> </dl> <div class='paging'>Total of 97 entries : <span>1-50</span> <a href=/list/cs.IT/2009-06?skip=50&show=50>51-97</a> </div> <div class='morefewer'>Showing up to 50 entries per page: <a href=/list/cs.IT/2009-06?skip=0&show=25 rel="nofollow"> fewer</a> | <span style="color: #454545">more</span> | <a href=/list/cs.IT/2009-06?skip=0&show=2000 rel="nofollow"> all</a> </div> </div> </div> </div> </main> <footer style="clear: both;"> <div class="columns is-desktop" role="navigation" aria-label="Secondary" style="margin: -0.75em -0.75em 0.75em -0.75em">  <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column" style="padding: 0;"> <div class="columns"> <div class="column"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul style="list-style: none; line-height: 2;"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>   </div> </footer> </div> <script src="/static/base/1.0.1/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Information Theory Jun 2009