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

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...

2009

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

Source and channel coding using Fountain codes

Bertrand Ndzana Ndzana

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

EPFL2009

Low-Density Codes Based on Chaotic Systems for Low-Density Codes Based on Chaotic Systems for Simple Encoding

Martin Hasler, Slobodan Kozic

This paper proposes a new class of low-density generator-matrix codes (LDGM) based on chaotic dynamical systems. The codes are designed by controlling symbolic dynamics and using linear convolutional codes. Analyzing the complex structure of chaotic system ...

2009

Compiling generics through user-directed type specialization

Martin Odersky, Iulian Dragos

Compilation of polymorphic code through type erasure gives compact code but performance on primitive types is significantly hurt. Full specialization gives good performance, but at the cost of increased code size and compilation time. Instead we propose a ...

ACM2009

On communication over discrete memoryless channels with noiseless feedback

Peter Allan Berlin

The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...

EPFL2008

Variability-Aware Design of Multilevel Logic Decoders for Nanoscale Crossbar Memories

Giovanni De Micheli, Mihai Adrian Ionescu, David Atienza Alonso, Didier Bouvet, Kirsten Emilie Moselund, Yusuf Leblebici, Mohamed Haykel Ben Jamaa

The fabrication of crossbar memories with sublithographic features is expected to be feasible within several emerging technologies; in all of them, the nanowire (NW) decoder is a critical part since it bridges the sublithographic wires to the outer circuit ...

2008

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

We generalize the results about how to compute iterative decoding thresholds over the binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC codes [2], [3]. We show in this case how density evolution can be performed in order ...

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

Distributed coding of multiresolution omnidirectional images

Pascal Frossard, Ivana Tosic, Vijayaraghavan Thirumalai

This paper addresses the problem of compact representation of a 3D scene, captured by distributed omnidirectional cameras. As the images from the sensors are likely to be correlated in most practical scenarios, we build a distributed algorithm based on cod ...

2007

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

Graph Chatbot

Chat with Graph Search

Expected loss analysis of thresholded authentication protocols in noisy conditions

Linear Universal Decoder for Compound Discrete Memoryless Channels

Polar codes for channel and source coding

Source and channel coding using Fountain codes

Low-Density Codes Based on Chaotic Systems for Low-Density Codes Based on Chaotic Systems for Simple Encoding

Compiling generics through user-directed type specialization

On communication over discrete memoryless channels with noiseless feedback

Variability-Aware Design of Multilevel Logic Decoders for Nanoscale Crossbar Memories

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

Distributed coding of multiresolution omnidirectional images

Source and channel coding using Fountain codes

Low-Density Codes Based on Chaotic Systems for Low-Density Codes Based on Chaotic Systems for Simple Encoding

Compiling generics through user-directed type specialization

On communication over discrete memoryless channels with noiseless feedback

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

Distributed coding of multiresolution omnidirectional images

Expected loss analysis of thresholded authentication protocols in noisy conditions

Linear Universal Decoder for Compound Discrete Memoryless Channels

Polar codes for channel and source coding

Variability-Aware Design of Multilevel Logic Decoders for Nanoscale Crossbar Memories