Concept

Linear code

Related publications (207)

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.

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

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

On the Minimum Distance of Non Binary LDPC Codes

Rethnakaran Pulikkoonattu

Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for ...

2008

Protection of data from erasures using subsymbol based codes

Mohammad Amin Shokrollahi

An encoder uses output symbol subsymbols to effect or control a tradeoff of computational effort and overhead efficiency to, for example, greatly reduce computational effort for the cost of a small amount of overhead efficiency. An encoder reads an ordered ...

2008

The Case for Structured Random Codes: Beyond Linear Models

Michael Christoph Gastpar

Recent work has shown that for some multi-user networks, carefully controlling the algebraic structure of the coding scheme may be just as useful as selecting the correct input distribution. In particular, for linear channel models, including finite field ...

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

Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes

Rüdiger Urbanke, Shrinivas Kudekar

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distri ...

2008

Asymmetric multi-level diversity coding

Suhas Diggavi

Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , k, where k is the number of encoders to which they have access. In this paper ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2008

Concentration of Magnetization for Linear Block Codes

Nicolas Macris, Satish Babu Korada, Shrinivas Kudekar

We consider communication over the binary erasure and the binary additive white gaussian noise channels using fixed linear block codes and also appropriate ensembles of such codes. We show concentration of the magnetization over the channel realizations an ...

2008

Diversity Embedded Space-Time Codes

Suhas Diggavi, Sanket Dusad

Rate and diversity impose a fundamental trade-off in wireless communication. High-rate space-time codes come at a cost of lower reliability (diversity), and high reliability (diversity) implies a lower rate. However, wireless networks need to support appli ...

2008

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009