On communication over discrete memoryless channels with noiseless feedback

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

Since polar were ratified as part of the 5G standard, low-complexity polar decoders with close-to-optimum error-rate performance have received significant attention. Compared to successive cancellation (SC) decoding, both SC list and SC flip decoding can i ...

We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...

Compared with the bit-wise successive cancellation list (SCL) decoding of polar codes, the node-based Fast SCL decoding significantly reduces the decoding latency by identifying special constituent codes and decoding these in parallel. To further reduce th ...

Due to the low-latency and high-reliability require-ments of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special constituent codes in the ...

Signal recovery under generative neural network priors has emerged as a promising direction in statistical inference and computational imaging. Theoretical analysis of reconstruction algorithms under generative priors is, however, challenging. For generati ...

We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Komlos that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with the expurg ...

The Gray-Wyner network subject to a fidelity criterion is studied. Upper and lower bounds for the trade-offs between the private sum-rate and the common rate are obtained for arbitrary sources subject to mean-squared error distortion. The bounds meet exact ...

Achieving a successful plasma current ramp-up in a full tungsten tokamak can be challenging due to the large core radiation (and resulting low core temperature) that can be faced with this heavy metallic impurity if its relative concentration is too high. ...

Highly energy-efficient wireless sensor nodes are a prerequisite for a sustainable operation of the Internet of things. Therefore, classical approaches for system design based on digital signal processing are not a viable solution, but system design has to ...

Universal inference enables the construction of confidence intervals and tests without regularity conditions by splitting the data into two parts and appealing to Markov's inequality. Previous investigations have shown that the cost of this generality is a ...

On communication over discrete memoryless channels with noiseless feedback

Chat with Graph Search

A Functional Perspective on Information Measures

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation

Multi-layer State Evolution Under Random Convolutional Design

Mismatched Decoding Reliability Function at Zero Rate

Shannon Bounds on Lossy Gray-Wyner Networks

Healing plasma current ramp-up by nitrogen seeding in the full tungsten environment of WEST

Spike-Based Sensing and Communication for Highly Energy-Efficient Sensor Edge Nodes

A note on universal inference