Concept

Table des symboles

Publications associées (22)

Automated Verification of Network Function Binaries

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

USENIX Association2022

A Compressed Sensing Approach for Distribution Matching

Vahid Aref, Mohamad Baker Dia

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary so ...

IEEE2018

Methods and apparatus employing FEC codes with permanent inactivation of symbols for encoding and decoding processes

Mohammad Amin Shokrollahi, Lorenz Minder

Encoding of a plurality of encoded symbols is provided wherein an encoded symbol is generated from a combination of a first symbol generated from a first set of intermediate symbols and a second symbol generated from a second set of intermediate symbols, e ...

2016

Error-correcting multi-stage code generator and decoder for communication systems having single transmitters or multiple transmitters

Mohammad Amin Shokrollahi

A communications system includes an encoder that produces a plurality of redundant symbols. For a given key, an output symbol is generated from a combined set of symbols including the input symbols and the redundant symbols. The output symbols are generall ...

2014

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

A tight bound on the performance of a minimal-delay joint source-channel coding scheme

Bixio Rimoldi, Marius Kleiner

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmit ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Method and apparatus for fast encoding of data symbols according to half-weight codes

Mohammad Amin Shokrollahi

Efficient methods for encoding and decoding Half-Weight codes are disclosed and similar high density codes are disclosed. The efficient methods require at most 3(k-1)+h/2+1 XORs of symbols to calculate h Half-Weight symbols from k source symbols, where h i ...

2010

Strategies for Delay-Limited Source-Channel Coding

Marius Kleiner

In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon's separation theorem. However, this is in general only true ...

EPFL2010

Forward error-correcting (FEC) coding and streaming

Mohammad Amin Shokrollahi

In a data decoder for decoding data from received symbols received over a channel from an encoder, a method for decoding data wherein the received data includes erasures and includes source symbols and repair symbols organized into one or more source block ...

2010

Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay

Bixio Rimoldi, Marius Kleiner

We present and analyze a joint source-channel coding strategy for the transmission of a Gaussian source across a Gaussian channel in n channel uses per source symbol. Among all such strategies, the scheme presented here has the following properties: i) the ...

IEEE2009

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search