An Analysis of Finite-Memory Random Linear Coding on Packet Streams

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.

Is it possible to design a packet-sampling algorithm that prevents the network node that performs the sampling from treating the sampled packets preferentially? We study this problem in the context of designing a "network transparency" system. In this syst ...

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

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

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

Real-time control of electric grids is a novel approach to handling the increasing penetration of distributed and volatile energy generation brought about by renewables. Such control occurs in cyber-physical systems (CPSs), in which software agents maintai ...

Current non-invasive Brain Machine interfaces commonly rely on the decoding of sustained motor imagery activity. This approach enables a user to control brain-actuated devices by triggering predetermined motor actions. However, despite of its broad range o ...

The privileged position of the Phasor Data Concentrator (PDC) in a synchrophasor-based monitoring system can be exploited to make this device the core of a distributed measurement architecture suitable for control and protection applications in power syste ...

In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which t ...

In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of polynomial-time algorithms, based on the projections onto first-order codes, is studied. An old representative of this class, originally developed for binary s ...

We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang's max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new exa ...

In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...

An Analysis of Finite-Memory Random Linear Coding on Packet Streams

Chat with Graph Search

Retroactive Packet Sampling for Traffic Receipts

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

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

A New Coding Paradigm for the Primitive Relay Channel

New Results On The Pseudoredundancy

Reliable and Robust Cyber-Physical Systems for Real-Time Control of Electric Grids

Reliable decoding of motor state transitions during imagined movement

Real-Scenario Testing of an Active Phasor Data Concentrator

On the Computational Complexity of Blind Detection of Binary Linear Codes

Improved decoding of second-order Reed-Muller codes

A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators

Approximate Decoding for Network Coded Inter-dependent Data