Families of Optimal Binary Non-MDS Erasure Codes

@article{Gligoroski2014FamiliesOO,
  title={Families of Optimal Binary Non-MDS Erasure Codes},
  author={D. Gligoroski and Katina Kralevska},
  journal={2014 IEEE International Symposium on Information Theory},
  year={2014},
  pages={3150-3154}
}
We introduce a definition for Families of Optimal Binary Non-MDS Erasure Codes for [n, k] codes over GF(2), and propose an algorithm for finding those families by using hill climbing techniques over Balanced XOR codes. [...] Key Result We also show a surprising result that for small values of k, the decoding probability of our codes in GF(2) is very close to the decoding probability of the codes obtained by Random Linear Network Coding but in the higher finite field GF(4).Expand
On optimization of wireless XOR erasure codes
Balanced locally repairable codes
On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields
Joint balanced source and network coding
Applied Erasure Coding in Networks and Distributed Storage

References

SHOWING 1-10 OF 48 REFERENCES
On near-MDS codes
Practical loss-resilient codes
Exact Decoding Probability Under Random Linear Network Coding
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Balanced XOR-ed Coding
On Code Parameters and Coding Vector Representation for Practical RLNC
Theory of Error-correcting Codes
...
1
2
3
4
5
...