Publication

A Formally Verified NAT Stack

Related publications (32)

Graph Chatbot

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.

Successive Refinement of Gaussian Projections

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be success ...

2014

GPUfs: Integrating a File System with GPUs

Bryan Alexander Ford

As GPU hardware becomes increasingly general-purpose, it is quickly outgrowing the traditional, constrained GPU-as-coprocessor programming model. To make GPUs easier to program and improve their integration with operating systems, we propose making the hos ...

2013

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Yuval Cassuto

For the recently proposed model of symbol-pair channels, we advance the pair-error coding theory with algebraic cyclic-code constructions and asymptotic bounds on code rates. Cyclic codes for pair-errors are constructed by a careful use of duals of known t ...

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

Given a code C is an element of F-2(n) and a word c is an element of C, a witness of c is a subset W subset of {, 1 ... , n} of coordinate positions such that c differs from any other codeword c' is an element of C on the indices in W. If any codeword poss ...

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

Polar codes for channel and source coding

Satish Babu Korada

The two central topics of information theory are the compression and the transmission of data. Shannon, in his seminal work, formalized both these problems and determined their fundamental limits. Since then the main goal of coding theory has been to find ...

EPFL2009

Finite-Length Scaling of Turbo-Like Code Ensembles on the Binary Erasure Channel

A possibility of estimating the finite-length performance of sparse-graph code ensembles gives two opportunities: to compare different codes of the same length in a context very close to real, practical applications and to perform the parameter optimizatio ...

2009

TwinDrivers: Semi-Automatic Derivation of Fast and Safe Hypervisor Network Drivers from Guest OS Drivers

Willy Zwaenepoel, Aravind Menon, Simon Schubert

In a virtualized environment, device drivers are often run inside a virtual machine (VM) rather than in the hypervisor. Doing so protects the hypervisor from bugs in the driver, and also allows the reuse of the device driver and its support infrastructure ...

ACM2009

Optimizing TCP Receive Performance

Willy Zwaenepoel, Aravind Menon

The performance of the networking stack in an operating system depends on the overhead incurred by two of its components: the per-byte overhead incurred in data-touching operations, and the per-packet overhead of protocol processing and other operating sys ...

2008

, ,

Signal processing algorithms become more and more complex and the algorithm architecture adaptation and design processes cannot any longer rely only on the intuition of the designers to build efficient systems. Specific tools and methods are needed to cope ...

2008