Publications related to Channel capacity

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Yuval Cassuto

For the recently proposed model of symbol-pair channels, we advance the pair-error coding theory with algebraic cyclic-code constructions and asymptotic bounds on code rates. Cyclic codes for pair-errors are constructed by a careful use of duals of known t ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Network Simplification: the Gaussian N-Relay Diamond Network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian

N

-relay diamond network, where a source wants to communicate to a destination through a layer of

N

-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only

k

out of the $ ...

2010

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing as a function of the average degree. Several variations on the basic theme have been proposed to date, all of which s ...

IEEE2010

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

Polar coding: a brief tour

Emre Telatar

Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless channels. In this talk I will attempt to describe this technique, and briefly discuss its extensions to q-ary input channels, multiple access channels and r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Information Theoretic Operating Regimes of Large Wireless Networks

Olivier Lévêque, Ayfer Özgür Aydin

In analyzing the point-to-point wireless channel, insights about two qualitatively different operating regimes --bandwidth- and power-limited-- have proven indispensable in the design of good communication schemes. In this paper, we propose a new scaling l ...

2010

Degraded Multicasting with Network Coding over the Combination Network

Christina Fragouli, Shirin Saeedi Bidokhti

In this paper, we give a characterization of the rate region for the degraded two message set problem, applied to a combination network with erasure channels. We also provide an algorithm that uses topological information in order to deliver the two messag ...

2010

Polar Codes for Q-ary Source Coding

Emre Telatar, Mohammad Karzand

Polar coding is a recent channel coding technique invented by Arikan to achieve the 'symmetric capacity' of binary-input memoryless channels. Subsequently it was observed by Korada and Urbanke that such codes are also good for lossy channel coding, achievi ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Network Simplification: the Gaussian N-Relay Diamond Network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian

N

-relay diamond network, where a source wants to communicate to a destination through a layer of

N

-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only

k

out of the $ ...

2010

Channel capacity

Graph Chatbot

Chat with Graph Search

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Rateless Codes for AVC Models

Zero-Rate Feedback Can Achieve the Empirical Capacity

Network Simplification: the Gaussian N-Relay Diamond Network

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

On the scaling of polar codes: II. The behavior of un-polarized channels

Polar coding: a brief tour

Information Theoretic Operating Regimes of Large Wireless Networks

Degraded Multicasting with Network Coding over the Combination Network

Polar Codes for Q-ary Source Coding

Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC

Rateless Codes for AVC Models

Polar Codes for Q-ary Source Coding

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Zero-Rate Feedback Can Achieve the Empirical Capacity

Information Theoretic Operating Regimes of Large Wireless Networks

Network Simplification: the Gaussian N-Relay Diamond Network

On the scaling of polar codes: II. The behavior of un-polarized channels

Degraded Multicasting with Network Coding over the Combination Network

Polar coding: a brief tour