Multiple Description Coding for Stationary Gaussian Sources

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.

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

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

In the last decade, DNA has been increasingly investigated as an alternative medium for cold data storage, presenting several advantages over standard hard drives such as a higher density, longer lifespan and lower energy consumption. However, such coding ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. P ...

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

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding ...

We consider a system of d non-linear stochastic fractional heat equations in spatial dimension 1 driven by multiplicative d-dimensional space-time white noise. We establish a sharp Gaussian-type upper bound on the two-point probability density function of ...

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

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

The application of Bayesian modeling techniques is increasingly common in neuroscience due to the coherent and principled way in which the paradigm deals with uncertainty. The Bayesian framework is particularly valuable in the context of complex, ill-posed ...

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding tech ...

Video streaming from remotely controlled moving platforms such as drones have stringent constraints in terms of delay. In some applications such videos have to provide real-time visual feedback to the pilot with an acceptable distortion while satisfying hi ...

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user to construct a h ...

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

Multiple Description Coding for Stationary Gaussian Sources

Chat with Graph Search

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

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Spectral Estimators for High-Dimensional Matrix Inference

Analysis of the influence of errors in DNA-based image coding

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Optima Age Over Erasure Channels

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Optimal lower bounds on hitting probabilities for non-linear systems of stochastic fractional heat equations

Cooperative Data Exchange and Private Information Retrieval

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Bayesian modeling of brain function and behavior

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Compute–Forward Multiple Access (CFMA): Practical Implementations

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

A New Coding Paradigm for the Primitive Relay Channel

Streaming From a Moving Platform with Real-Time and Playback Distortion Constraints

LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel

New Results On The Pseudoredundancy

Gaussian channel transmission of images and audio files using cryptcoding

Single-server Multi-user Private Information Retrieval with Side Information