Work

Streaming Codes for Three-Node Relay Networks With Burst Erasures

Year: 2024

Type: article

Abstract: We study burst erasure correcting streaming codes for three-node relay networks, where there is a source-relay link and a relay-destination link. These codes guarantee that all message packets are recovered within a delay of$\tau $time slots, given that a single burst erasure of length at most b packets occurs in both links. Leveraging previously known techniques in the streaming code literature, we first provide a simple upper bound on the rate of burst erasure correcting streaming codes for three-node relay networks. Our main result is a coding scheme that achieves rates arbitrarily close to the rate upper bound, as message size increases.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2024.3504538

Authors: Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan

Institutions: Tel Aviv University, Indian Institute of Technology Hyderabad, Indian Institute of Technology Palakkad

Language: English

Topic: Cooperative Communication and Network Coding

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,495

Funder: Indian Institute of Technology Hyderabad