- Updatable encryption in distributed storage systems using key-homomorphic pseudorandom functions
- Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Integrated interleaved codes as locally recoverable codes: properties and performance
- Cooperative repair of multiple node failures in distributed storage systems
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
27 January 2017
Free sample articles newly available from International Journal of Information and Coding Theory
The following sample articles from the International Journal of Information and Coding Theory are now available here for free:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment