ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length

Babu, Balaji Srinivasan and Kini, Ganesh R and Kumar, (2018) A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. In: 2018 Twenty Fourth National Conference on Communications (NCC), FEB 25-28, 2018, Hyderabad, INDIA.

[img] PDF
1801.06794.pdf - Published Version
Restricted to Registered users only

Download (298kB) | Request a copy

Abstract

An erasure code is said to be a code with sequential recovery with parameters r and t, if for any s <= t erased code symbols, there is an s-step recovery process in which at each step we recover exactly one erased code symbol by contacting at most r other code symbols. In this paper, we give a construction of binary codes with sequential recovery that are rate-optimal for any value of t and any value r >= 3. Our construction is based on construction of certain kind of tree-like graphs with girth t + 1. We construct these graphs and hence the codes recursively.

Item Type: Conference Proceedings
Additional Information: 24th National Conference on Communications (NCC), Hyderabad, INDIA, FEB 25-28, 2018
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Id for Latest eprints
Date Deposited: 19 Mar 2019 09:02
Last Modified: 19 Mar 2019 09:02
URI: http://eprints.iisc.ac.in/id/eprint/61967

Actions (login required)

View Item View Item