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.
Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...
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 ...
The contribution of this thesis is twofold. In the first part, we generalize and analyze two classes of error correcting codes: LDPC codes and product codes. We generalize graphical codes by considering checks being arbitrary codes instead of single pariti ...
We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E-0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarizat ...
Institute of Electrical and Electronics Engineers2014
This paper introduces and studies a class of optimal control problems based on the Clebsch approach to Euler-Poincare dynamics. This approach unifies and generalizes a wide range of examples appearing in the literature: the symmetric formulation of N-dimen ...
Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemb ...
The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...
Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...
Institute of Electrical and Electronics Engineers2014
A symmetric squaraine and its related non-symmetric structure are shown to have comparable efficiencies in DSCs, but with undoubtedly advantages in the low cost and casiness of synthesis for the symmetrical structure. ...
Let be a symmetric space of noncompact type. A result of Gelander provides exponential upper bounds in terms of the volume for the torsion homology of the noncompact arithmetic locally symmetric spaces . We show that under suitable assumptions on this resu ...
