Publications associées à Théorie des codes

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.

ECMA-407: New Approaches to 3D Audio Content Data Rate Reduction with RVC-CAL

Marco Mattavelli, Claudio Paolo Alberti, Junaid Jameel Ahmad

Inverse problems have only been known in spatial audio for a very short time; their only solution, called "inverse coding" in literature, is essentially based on time-level modeling. Inverse problems, however, unlike parametric coding, require only an init ...

Audio Engineering Society (AES)2014

Depth-based multiview distributed video coding

Thomas Maugey

Multiview distributed video coding (DVC) has gained much attention in the last few years because of its potential in avoiding communication between cameras without decreasing the coding performance. However, the current results are not matching the expecta ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Polarization Improves E-0

Emre Telatar, Mine Alsan

We prove that channel combining and splitting via Arikan's polarization transformation improves Gallager's reliability function E-0 for binary input channels. In this sense, polarization creates E-0. This observation gives yet another justification as to w ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Tracking freeriders in gossip-based content dissemination systems

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwid ...

Elsevier2014

Decoding Delay Minimization in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources tr ...

Institute of Electrical and Electronics Engineers2014

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Michael Christoph Gastpar, Amos Lapidoth

A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback. For all noise correlations other than ±1, the gap between the sumrate that the scheme achieves and the full-cooperation bound vanishes as the sig ...

Institute of Electrical and Electronics Engineers2014

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Martino Borello

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...

Institute of Electrical and Electronics Engineers2013

Polar Codes for the Two-User Multiple-Access Channel

Emre Telatar, Eren Sasoglu

Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...

Institute of Electrical and Electronics Engineers2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Théorie des codes

Graph Chatbot

Chattez avec Graph Search

ECMA-407: New Approaches to 3D Audio Content Data Rate Reduction with RVC-CAL

Depth-based multiview distributed video coding

Polarization Improves E-0

Tracking freeriders in gossip-based content dissemination systems

Decoding Delay Minimization in Inter-Session Network Coding

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Polar Codes for the Two-User Multiple-Access Channel

Polarization and Spatial Coupling

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Tracking freeriders in gossip-based content dissemination systems

Polarization Improves E-0

Decoding Delay Minimization in Inter-Session Network Coding

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24

Depth-based multiview distributed video coding

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Polarization and Spatial Coupling

ECMA-407: New Approaches to 3D Audio Content Data Rate Reduction with RVC-CAL

Coding Schemes and Asymptotic Capacity for the Gaussian Broadcast and Interference Channels With Feedback

Polar Codes for the Two-User Multiple-Access Channel