Publication

A Connection between Network Coding and Convolutional Codes

Related publications (42)

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.

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

2016

The MEU web platform: a tool dedicated to urban energy management

Gaëtan Cherix, Massimiliano Capezzali, Pablo Puerto, Mathias Franz Pernet

The MEU GIS-enabled web-platform [1] has been developed in close collaboration with four Swiss cities. The tool enables detailed monitoring and planning for both energy demand and supply at individual building, neighborhood and whole city scale (http://meu ...

LESO-PB, EPFL2015

Decoding Delay Minimization in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources tr ...

Institute of Electrical and Electronics Engineers2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Privacy and Dynamics of Social Networks

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...

EPFL2013

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Privacy and Dynamics of Social Networks (PhD Thesis: pre-print)

Pedram Pedarsani

2012

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

Graph-Based Information Processing

Amin Karbasi

We live in a world characterized by massive information transfer and real-time communication. The demand for efficient yet low-complexity algorithms is widespread across different fields, including machine learning, signal processing and communications. Mo ...

EPFL2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012