Degree Distribution Optimization in Raptor Network Coding

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.

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

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

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

Chemical gas dispersion can represent a severe threat to human and animal lives, as well as to the environment. Constructing a map of the distribution of gas in a fast and reliable manner is critical to ensure accurate monitoring of at-risk facilities and ...

Humans can rapidly estimate the statistical properties of groups of stimuli, including their average and variability. But recent studies of so-called Feature Distribution Learning (FDL) have shown that observers can quickly learn even more complex aspects ...

The ability to predict the spatial distribution of tree root system variables (e.g., the Root system Area (RA), the maximum root diameter, the number of roots in diameter classes, the density of fine roots, etc.) under different environmental conditions is ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...

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

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

LoRaWAN is a low-power wireless technology that provides long-range connectivity to battery-powered Internet of Things (IoT) devices. To minimize the energy consumption of the IoT nodes, LoRaWAN networks use for the uplink a pure non-slotted ALOHA multiple ...

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smalle ...

Degree Distribution Optimization in Raptor Network Coding

Chattez avec Graph Search

On the Efficiency of Polar-Like Decoding for Symmetric Codes

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

A Functional Perspective on Information Measures

Clustering and Informative Path Planning for 3D Gas Distribution Mapping: Algorithms and Performance Evaluation

Feature distribution learning by passive exposure

Tree root distribution modelling in different environmental conditions

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

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

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

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

Enhancing the Reliability of Dense LoRaWAN Networks With Multi-User Receivers

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance