Person

Ghid Maatouk

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.

Untrusting network coding

Ghid Maatouk, Christina Fragouli, Vinod Malathidevi Prabhakaran, Yasin Buyukalp

In networks that perform linear network coding, an intermediate network node may receive a much larger number of linear equations of the source symbols than the number of messages it needs to send. For networks constructed by untrusted nodes, we propose a ...

2012

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

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

In this paper, the second moment of the ripple size during the Luby transform (LT) decoding process is analyzed. Combined with a result by Karp et al. (2004) stating that the expectation of the ripple size is of the order of k, our study gives bounds on th ...

2012

On Sums of Locally Testable Affine Invariant Properties

Ghid Maatouk, Elena Grigorescu

Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider ...

Springer2011

Symmetric LDPC codes are not necessarily locally testable

Ghid Maatouk

Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known that a code must be a "low-density parity check" (LDPC) code for it to be loca ...

2010

Analysis of the Second Moment of the LT Decoder

Mohammad Amin Shokrollahi, Ghid Maatouk

We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length k is of the order of root k. Together with a result by Karp et. al (2004) stating that the ex ...

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

Good Ensembles of Goppa Codes

Ghid Maatouk

It is well-known that random error-correcting codes achieve the Gilbert-Varshamov bound with high probability. In [2], the authors describe a construction which can be used to yield a polynomially large family of codes of which a large fraction achieve the ...

2007