Exploiting Common Randomness: a Resource for Network Secrecy

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.

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

Billions of people now have conversations daily over the Internet. A large portion of this communication takes place via secure messaging protocols that offer "end-to-end encryption'" guarantees and resilience to compromise like the widely-used Double Ratc ...

Modern digital connectivity has necessitated the creation of robust methods for securely storing and transferring data. At the heart of all security infrastructure is the random number generator (RNG). While random numbers find use in a variety of applicat ...

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

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

Under the trends of multifunctionality, tunability, and compactness in modern wave -based signal processors, in this paper, we propose a polarization-multiplexed graphene-based metasurface to realize distinct mathematical operators on the parallel time-dom ...

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

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

In this work, we tackle the problem of minimising the Conditional-Value-at-Risk (CVaR) of output quantities of complex differential models with random input data, using gradient-based approaches in combination with the Multi-Level Monte Carlo (MLMC) method ...

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

In this paper, we explore the use of channel state information (CSI) from a WiFi system to estimate the breathing rate of a person in a room. In order to extract WiFi CSI components that are sensitive to breathing, we propose to consider the delay domain c ...

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called po ...

Recently, a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and gen ...

Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference. Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

Sampling is classically performed by recording the amplitude of the input at given time instants; however, sampling and reconstructing a signal using multiple devices in parallel becomes a more difficult problem to solve when the devices have an unknown sh ...

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

The feedback sum-rate capacity is established for the symmetric

J

-user Gaussian multiple-access channel (GMAC). The main contribution is a converse bound that combines the dependence-balance argument of Hekstra and Willems (1989) with a variant of the f ...

This work presents a technique to produce random bits by exploiting single-photon time of arrival. Two quantum random number generator (QRNG) devices based on the field programmable gate array (FPGA) technology are presented: Randy, which uses one discrete ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

Exploiting Common Randomness: a Resource for Network Secrecy

Chattez avec Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

On the Theory and Practice of Modern Secure Messaging

Modelling and design of CMOS SPAD sensors for quantum random number generation

Symmetry in design and decoding of polar-like codes

Optima Age Over Erasure Channels

Parallel temporal signal processing enabled by polarization-multiplexed programmable THz metasurfaces

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Optimal Matching of Random Parts

Gradient-based optimisation of the conditional-value-at-risk using the multi-level Monte Carlo method

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

ComplexBeat: Breathing Rate Estimation from Complex CSI

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding

Adaptive Path Interpolation Method for Sparse Systems: Application to a Censored Block Model

Cooperative Data Exchange and Private Information Retrieval

On the Universality of Low-Density Parity-Check Block Codes

Sampling and Reconstruction of Bandlimited Signals with Multi-Channel Time Encoding

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels With Feedback

Efficient random number generation techniques for CMOS single-photon avalanche diode array exploiting fast time tagging units

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations