On communication over discrete memoryless channels with noiseless feedback
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.
Satellite-UMTS supports broadcast applications that involve transmission of the same encoded data over channels that may vary significantly. The same code must allow a user with a good channel to recover the information with low complexity, while a user wi ...
We analyze iterative coding for the frame-synchronous binary-input discrete-time Gaussian multiple access channel. Using the method of Density Evolution, we optimize degree distributions to exhibit code ensembles whose iterative decoding thresholds are onl ...
When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...
We construct new families of error-correcting codes based on Gallager's (1973) low-density parity-check codes. We improve on Gallager's results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these co ...
This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis-coded modulation and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. Th ...
This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate enco ...
This paper presents parallel concatenated turbo codes that employ a non-uniform constellation to achieve shaping gain. The output signal approximates the Gaussian distribution by using equally likely signals with unequal spacing (a non-uniform constellatio ...
This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the ...
For certain fortunate choices of source/channel pairs, all sophisticated coding is in vain: for them, a code of block length one is sufficient to achieve optimal performance \cite{mgbrmvtrans}. Is the set of ``fortunate choices'' larger if we allow for cod ...
We design sequences of low-density parity check codes that provably perform at rates extremely close to the Shannon capacity. These codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. We further show ...
