Publication

Joint source-channel coding with feedback

Publications associées (181)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

List-Decoding for the Arbitrarily Varying Channel Under State Constraints

Michael Christoph Gastpar

List-decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list-decoding using l ...

2012

On the Structure of the Capacity Region of Asynchronous Memoryless Multiple-Access Channels

Bixio Rimoldi, Ninoslav Marina

The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that an extension of ...

2012

On Two Unicast Wireless Networks with Destination-to-Source Feedback

I-Hsiang Wang

In this paper we study the role of feedback in layered two unicast wireless networks with arbitrary number of nodes and connectivity. The feedback model allows destinations to feedback their received signals to their respective sources. In the case of line ...

Ieee2012

Broadcasting Nested Message Sets

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In this paper, we take a deterministic approach to the problem of broadcasting nested message sets. We mainly consider the scenario where a common message and a private message are to be encoded into a signal and transmitted over a broadcast channel toward ...

2012

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...

EPFL2011

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

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

Interactive multiview video system with low decoding complexity

Pascal Frossard, Thomas Maugey

Research in multimedia is always investigating new ways of improving the immersive experience of the users. One current solution consists in designing systems which offer a high level of interactivity, such as multiview content navigation where the point o ...

2011

Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders

In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizin ...

2011

Polar coding schemes for the AWGN channel

Emmanuel Abbé

This paper investigates polar coding schemes achieving capacity for the AWGN channel. The approaches using a multiple access channel with a large number of binary-input users and a single-user channel with a large prime-cardinality input are compared with ...

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

Does Fast Adaptive Modulation Always Outperform Slow Adaptive Modulation?

Laura Toni

Link adaptation techniques are important modern and future wireless communication systems to cope with quality of service fluctuations in fading channels. These techniques require the knowledge of the channel state obtained with a portion of resources devo ...

Institute of Electrical and Electronics Engineers2011