• 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

Topics from this paper.

Citations

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

Rate optimal binary linear locally repairable codes with small availability

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

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

Achieving arbitrary locality and availability in binary codes

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Binary Linear Locally Repairable Codes

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Bounds on the Parameters of Locally Recoverable Codes

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Codes with locality for two erasures

VIEW 5 EXCERPTS

Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Rate optimal binary linear locally repairable codes with small availability

VIEW 2 EXCERPTS

Recursive bounds for locally repairable codes with multiple repair groups

VIEW 1 EXCERPT

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

VIEW 1 EXCERPT

Some Improvements on Locally Repairable Codes

VIEW 1 EXCERPT

A family of optimal locally recoverable codes

VIEW 1 EXCERPT