Publication

Protection of data from erasures using subsymbol based codes

Related publications (47)

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.

An efficient deterministic test for Kloosterman sum zeros

Robert Granger

We propose a simple deterministic test for deciding whether or not a non-zero element

a \in \mathbb{F}_{2^n}

\mathbb{F}_{3^n}

is a zero of the corresponding Kloosterman sum over these fields, and analyse its complexity. The test seems to have been o ...

American Mathematical Society2014

Polarity-Balanced Codes

Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q+1,−q+3, . . . , q−1}, known concept ...

2013

Cramer-Karhunen-Loeve representation and harmonic principal component analysis of functional time series

Victor Panaretos, Shahin Tavakoli

We develop a doubly spectral representation of a stationary functional time series, and study the properties of its empirical version. The representation decomposes the time series into an integral of uncorrelated frequency components (Cramer representatio ...

Elsevier2013

Hydraulique des canalisations

Les réseaux d’assainissement font partie des infrastructures clés des pays industrialisés. Selon l’Office fédéral de l’environnement, environ 50'000 km de canalisations publiques sont installés en Suisse, avec une valeur de remplacement supérieure à 50 mil ...

EPFL - LCH2013

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

Crossbar switch decoder for vector signaling codes

Mohammad Amin Shokrollahi

An efficient decoding of vector signaling codes is obtained using a circuit that ranks received signal levels, designates ranked values as representing particular code elements, and translates those particular code elements into a decoded result. An optimi ...

2012

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

Phase Transitions for Mutual Information

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati, Raj Kumar Krishna Kumar

We consider ensembles of binary linear error correcting codes, obtained by sampling each column of the generator matrix G or parity check matrix H independently from the set of all binary vectors of weight d (of appropriate dimension). We investigate the c ...

IEEE2010

Block copolymers and uses thereof

Jeffrey Alan Hubbell, Melody Swartz, Conlin O'Neil

An encoding/decoding apparatus and method using a low-density parity-check code (LDPC code) is disclosed. Basic column group information, serving as a set of information regarding positions of rows with weight 1, is extracted from a reference column in eac ...

2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...

2010

An efficient deterministic test for Kloosterman sum zeros

Robert Granger

We propose a simple deterministic test for deciding whether or not a non-zero element

a \in \mathbb{F}_{2^n}

\mathbb{F}_{3^n}

is a zero of the corresponding Kloosterman sum over these fields, and analyse its complexity. The test seems to have been o ...

American Mathematical Society2014