English
Related papers

Related papers: Rate-Optimal Streaming Codes over Three-Node Relay…

200 papers

The two-sender unicast index coding problem consists of finding optimal coded transmissions from the two senders which collectively know the messages demanded by all the receivers. Each receiver demands a unique message. One important class…

Information Theory · Computer Science 2018-08-30 Chinmayananda Arunachala , Vaneet Aggarwal , B. Sundar Rajan

In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This exact expression…

Information Theory · Computer Science 2008-04-04 Ghassan M. Kraidy , Valentin Savin

We focus on the design of distributed Luby transform (DLT) codes for erasure networks with multiple sources and multiple relays, communicating to a single destination. The erasure-floor performance of DLT codes improves with the maximum…

Information Theory · Computer Science 2016-11-17 Iqbal Hussain , Ming Xiao , Lars K. Rasmussen

We study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process…

Information Theory · Computer Science 2017-06-12 Emmanouil Skevakis , Ioannis Lambadaris , Hassan Halabian

In this paper, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmission schedules. We consider both lossless networks and…

Information Theory · Computer Science 2012-02-03 Anoosheh Heidarzadeh , Amir H. Banihashemi

Under the assumption of outdated channel state information (CSI) at the source, we consider the finite blocklength (FBL) throughput of a two-hop relaying system. Previous work has considered this setting so far only for the infinite…

Information Theory · Computer Science 2017-03-27 Yulin Hu , Anke Schmeink , James Gross

In this paper, we introduce novel coding schemes for wireless networks with random transmission delays. These coding schemes obviate the need for synchronicity, reduce the number of transmissions and achieve the optimal rate region in the…

Information Theory · Computer Science 2015-03-04 Niv Voskoboynik , Haim H. Permuter , Asaf Cohen

This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory,…

Information Theory · Computer Science 2013-11-12 Neda Aboutorab , Parastoo Sadeghi , Sameh Sorour

In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed…

Information Theory · Computer Science 2015-10-14 Deli Qiao

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over…

Information Theory · Computer Science 2016-11-15 Joao Barros , Rui A. Costa , Daniele Munaretto , Joerg Widmer

The perceived quality of real-time media delivered over IP networks depends on both the rate and burstiness of packet loss. In this paper, we develop a new mathematical model for the residual burstiness of loss under erasure coding. We…

Information Theory · Computer Science 2019-11-11 Bobak McCann , Kerry Fendick

Data streaming transmission over a block fading channel is studied. It is assumed that the transmitter receives a new message at each channel block at a constant rate, which is fixed by an underlying application, and tries to deliver the…

Information Theory · Computer Science 2012-09-20 Giuseppe Cocco , Deniz Gündüz , Christian Ibars

We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several…

Information Theory · Computer Science 2025-04-07 Yeyuan Chen , Mahdi Cheraghchi , Nikhil Shagrithaya

We characterise bounds on the optimal broadcast rate for a few classes of pliable-index-coding instances. Unlike the majority of currently solved instances, which belong to a special class where all receivers with a certain side-information…

Information Theory · Computer Science 2025-12-09 Lawrence Ong , Badri N. Vellambi , Parastoo Sadeghi , Jörg Kliewer

Motivated by emerging vision-based intelligent services, we consider the problem of rate adaptation for high quality and low delay visual information delivery over wireless networks using scalable video coding. Rate adaptation in this…

Multimedia · Computer Science 2017-04-11 Hussein Al-Zubaidy , Viktoria Fodor , György Dán , Markus Flierl

We consider the delay of network coding compared to routing with retransmissions in packet erasure networks with probabilistic erasures. We investigate the sub-linear term in the block delay required for unicasting $n$ packets and show that…

Information Theory · Computer Science 2012-11-15 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho , Michelle Effros

We study sequential coding of Markov sources under an error propagation constraint. An encoder sequentially compresses a sequence of vector-sources that are spatially i.i.d. but temporally correlated according to a first-order Markov…

Information Theory · Computer Science 2012-02-24 Farrokh Etezadi , Ashish Khisti , Mitchell Trott

Transmission of high-definition (HD) video is a promising application for 60 GHz wireless links, since very high transmission rates (up to several Gbit/s) are possible. In particular we consider a sports stadium broadcasting system where…

Networking and Internet Architecture · Computer Science 2013-02-13 Joongheon Kim , Yafei Tian , Stefan Mangold , Andreas F. Molisch

In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network…

Information Theory · Computer Science 2014-01-06 Amy Fu , Parastoo Sadeghi , Muriel Medard

In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober