Publication

Coding Schemes for Line Networks

Christina Fragouli
2005
Conference Papers

Abstract

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.

Official source

https://infoscience.epfl.ch/entities/publication/2c931547-5c0b-4c49-9bd4-cdca57cf3229

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Coding Schemes for Line Networks

Chat with Graph Search

The Skin of Venice: A Computational Approach to the City's Urban Structure

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Inhalation of Microplastics—A Toxicological Complexity