Concept
Channel capacity
Related publications (454)
On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024Hitting with Probability One for Stochastic Heat Equations with Additive Noise
We study the hitting probabilities of the solution to a system of d stochastic heat equations with additive noise subject to Dirichlet boundary conditions. We show that for any bounded Borel set with positive (d-6)\documentclass[12pt]{minimal} \usepackage{ ...
Springer/Plenum Publishers2024On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels
Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...
2023Low Power LDPC Decoding by Reliable Voltage Down-Scaling
Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...
New York2023Federated Linear Bandit Learning via Over-the-air Computation
Yuning Jiang, Xin Liu, Ting Wang
In this paper, we investigate federated contextual linear bandit learning within a wireless system that comprises a server and multiple devices. Each device interacts with the environment, selects an action based on the received reward, and sends model upd ...
IEEE2023Optima Age Over Erasure Channels
Emre Telatar, Elie Najm, Rajai Nasser
Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022Symmetry in design and decoding of polar-like codes
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
EPFL2022A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...
2022Beam Selection and Tracking for Amplify-and-Forward Repeaters
Andreas Peter Burg, Adrian Schumacher, Ruben Merz
Mobile network operators constantly have to upgrade their cellular network to satisfy the public's hunger for increasing data capacity. However, regulatory limits regarding allowed electromagnetic field strength on existing cell sites often limit or preven ...
IEEE2022On the Efficiency of Polar-Like Decoding for Symmetric Codes
Rüdiger Urbanke, Kirill Ivanov
The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022