• Mathematics, Computer Science
• Published in ArXiv 2016

# Bounds on Codes with Locality and Availability

@article{Babu2016BoundsOC,
title={Bounds on Codes with Locality and Availability},
author={Balaji Srinivasan Babu and P. Vijay Kumar},
journal={ArXiv},
year={2016},
volume={abs/1611.00159}
}
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 \times n)$ parity… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

## Rate optimal binary linear locally repairable codes with small availability

• Mathematics, Computer Science
• 2017 IEEE International Symposium on Information Theory (ISIT)
• 2017
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions

• Computer Science, Mathematics
• ArXiv
• 2018
VIEW 3 EXCERPTS
CITES BACKGROUND

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

## Achieving arbitrary locality and availability in binary codes

• Mathematics, Computer Science
• 2015 IEEE International Symposium on Information Theory (ISIT)
• 2015
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

## Binary Linear Locally Repairable Codes

• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2015
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## Bounds on the Parameters of Locally Recoverable Codes

• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2015
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

## Codes with locality for two erasures

• Computer Science, Mathematics
• 2014 IEEE International Symposium on Information Theory
• 2014
VIEW 5 EXCERPTS

## Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance

• Mathematics, Computer Science
• ArXiv
• 2015
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## Rate optimal binary linear locally repairable codes with small availability

• Mathematics, Computer Science
• 2017 IEEE International Symposium on Information Theory (ISIT)
• 2017
VIEW 2 EXCERPTS

## Recursive bounds for locally repairable codes with multiple repair groups

• Computer Science
• 2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
VIEW 1 EXCERPT

## Two classes of (r, t)-locally repairable codes

• Mathematics, Computer Science
• 2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
VIEW 1 EXCERPT

## Some Improvements on Locally Repairable Codes

• Jun Zhang, Xin Wang
• Mathematics, Computer Science
• ArXiv
• 2015
VIEW 1 EXCERPT

## A family of optimal locally recoverable codes

• Computer Science, Mathematics
• 2014 IEEE International Symposium on Information Theory
• 2014
VIEW 1 EXCERPT