Systematic encoding and decoding of chain reaction codes

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.

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

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

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms ...

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

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

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommoda ...

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasi-group structure on the input alphabet. Just as with usual polar codes, the block error probability under successive cancellation decoding is O(2^(-N^(1/2-epsilon))), where N ...

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formaliz ...

We investigate the problem of recovering source information from an incomplete set of network coded data with help of prior information about the sources. This problem naturally arises in wireless networks, where the number of network coded packets availab ...

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...

Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

In this paper, the second moment of the ripple size during the Luby transform (LT) decoding process is analyzed. Combined with a result by Karp et al. (2004) stating that the expectation of the ripple size is of the order of k, our study gives bounds on th ...

The invention of Fountain codes is a major advance in the field of error correcting codes. The goal of this work is to study and develop algorithms for source and channel coding using a family of Fountain codes known as Raptor codes. From an asymptotic poi ...

This paper presents a distributed coding scheme for the representation of 3D scenes captured by omnidirectional cameras. We consider a scenario with a pair of similar cameras that benefit from equivalent bandwidth and computational resources. The images ar ...

Wyner-Ziv (WZ) video coding is an emerging video coding paradigm based on two major Information Theory results: the Slepian-Wolf and Wyner-Ziv theorems. One of the most interesting and used WZ video coding architectures makes use of a feedback channel (FC) ...

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

This work deals with coding systems based on sparse graph codes. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connec ...

A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), recovering the value of ...

This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...

Systematic encoding and decoding of chain reaction codes

Chattez avec Graph Search

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

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

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

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

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Online Fountain Codes With Low Overhead

Reconstruction of Network Coded Sources From Incomplete Datasets

Low Complexity Scheduling and Coding for Wireless Networks

Secure Network Coding with Erasures and Feedback

Rate allocation and optimized decoding in inter-session network coding

Analysis of the Second Moment of the LT Decoder

Source and channel coding using Fountain codes

Symmetric Distributed Coding of Stereo Omnidirectional Images

Studying Error Resilience Performance for a Feedback Channel Based Transform Domain Wyner-Ziv Video Codec

Fountain Codes for the Slepian-Wolf Problem

Conservation laws for coding

Decoding of chain reaction codes through inactivation of recovered symbols

Asymptotic and finite-length analysis of low-density parity-check codes