Bounds on the Rate and Minimum Distance of Codes with Availability

Balaji, SB and Kumar, Vijay P (2017) Bounds on the Rate and Minimum Distance of Codes with Availability. In: IEEE International Symposium on Information Theory (ISIT), JUN 25-30, 2017, Aachen, GERMANY.

PDF Ieee_Int_Sym_Int_The_2017.pdf - Published Version Restricted to Registered users only Download (344kB) | Request a copy

Abstract

In this paper we investigate bounds on rate and minimum distance of codes with t availability. We present bounds on minimum distance of a code with t availability that are tighter than existing bounds. For bounds on rate of a code with t availability, we restrict ourselves to a sub-class of codes with t availability called codes with strict t availability and derive a tighter rate bound. Codes with strict t availability can be defined as the null space of an (m x n) parity-check matrix H, where each row has weight (r + 1) and each column has weight t, with intersection between support of any two rows at most one. We also present two general constructions for codes with t availability.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	18 May 2018 15:59
Last Modified:	25 Feb 2019 08:44
URI:	http://eprints.iisc.ac.in/id/eprint/59907

Actions (login required)

View Item