2016/11/01 by S. B. Balaji, Balaji, S. B., P. Vijay Kumar +1
Computer Science · #Advanced Data Storage Technologies #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1611.00159
openalex publication_date 2016/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 × 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 atmost one. We also present two general constructions for codes with t availability.