Publications by Marco Mondelli

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.

The year 2016, in which I am writing these words, marks the centenary of Claude Shannon, the father of information theory. In his landmark 1948 paper "A Mathematical Theory of Communication", Shannon established the largest rate at which reliable communica ...

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding tech ...

This paper presents polar coding schemes for the two-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is tight for all clas ...

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming SG standard. As such, a lot of attention has been devoted to the development of decoding algori ...

With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor ...

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smalle ...

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed, and the tradeoff betwe ...

We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to ...

We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user ...

According to certain embodiments, a transmit node in a wireless communications system includes a first universal rate-compatible polar encoder and a transmitter. The first universal rate-compatible polar encoder is configured for a family of two or more ty ...

Marco Mondelli

Chat with Graph Search

From Polar to Reed-Muller Codes : Unified Scaling, Non-standard Channels, and a Proven Conjecture

A New Coding Paradigm for the Primitive Relay Channel

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Decoder Partitioning: Towards Practical List Decoding of Polar Codes

Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Construction of Polar Codes With Sublinear Complexity

From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance

Scaling Exponent of List Decoders with Applications to Polar Codes

Scaling Exponent of List Decoders With Applications to Polar Codes

A New Coding Paradigm for the Primitive Relay Channel

Achieving Marton's Region for Broadcast Channels Using Polar Codes

Systems and methods for rate-compatible polar codes for general channels