Concept

Théorie des codes

Publications associées (486)

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

Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. W ...

2011

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

Error control coding for orthogonal differential vector signaling

Mohammad Amin Shokrollahi, Harm Cronie

Using a transformation based, at least in part, on a non-simple orthogonal matrix, data may be transmitted over a data bus in a manner that is resilient to one or more types of signal noise, that does not require a common reference at the transmission and ...

2011

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 ...

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

Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC

Rüdiger Urbanke, Shrinivas Kudekar

Convolutional low-density parity-check (LDPC) ensembles, introduced by Felstrom and Zigangirov, have excellent thresholds and these thresholds are rapidly increasing functions of the average degree. Several variations on the basic theme have been proposed ...

2011

Degree Distribution Optimization in Raptor Network Coding

Pascal Frossard, Nikolaos Thomos

We consider a multi-source delivery system, where Raptor coding at sources and linear network coding in overlay nodes work in concert for efficient data delivery in networks with diversity. Such a combination permits to increase throughput and loss resilie ...

2011

Network Coding: Beyond Throughput Benefits

Christina Fragouli

Network coding enables novel network functionalities and thus offers a wider canvas of choices when optimizing an information flow problem. In this paper, we examine the simplest possible information flow problem, a unicast connection, and explore what we ...

2011

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

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