We presented an invited paper on “Algorithms for Asynchronous Coded Caching” at the 51st Asilomar Conference on Signals, Systems and Computers in Monterey, CA. The paper was co-authored by Hooshang and Aditya.
New paper accepted to the IEEE Transactions on Information Theory
A paper titled “Sum-networks from incidence structures: construction and capacity analysis” co-authored with Ardhendu has been accepted to the IEEE Transactions on Information Theory. Congratulations, Ardhendu!
New NSF award on coded caching
The National Science Foundation (NSF) funds our work on coded caching. The award is titled: “Towards practical coded caching“. NSF’s support is gratefully acknowledged.
Update (08/17/2017): ISU College of Engineering story. Available here.
New preprint titled: “Low Subpacketization Schemes for Coded Caching”
Co-authored with my student Li Tang. Available here.
It has the following abstract.
Abstract: Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (i.e., the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose coded caching schemes based on combinatorial structures called resolvable designs. These structures can be obtained in a natural manner from linear block codes whose generator matrices possess certain rank properties. We demonstrate that several schemes with subpacketization levels that are exponentially smaller than the basic scheme can be obtained.
Promoted to the rank of Professor (effective Fall semester 2017).
New paper accepted to the IEEE Transactions on Information Theory
A paper titled “Improved Lower Bounds for Coded Caching” co-authored with Hooshang has been accepted to the IEEE Transactions on Information Theory. Congratulations, Hooshang!
Two papers accepted to ISIT 2017
- Papers “Asynchronous Coded Caching” (co-authored with Hooshang) and “Low Subpacketization Schemes for Coded Caching” (co-authored with Li) have been accepted to ISIT 2017. Congratulations to Hooshang and Li!
Seminars at Rice, Texas A&M and UT-Austin
Aditya gave talks on: “Combinatorial Designs for distributed data storage, function computation and coded caching” at Rice, Texas A&M and Houston in Oct. 2016. The talks were based on joint work with Oktay Olmez, Ardhendu Tripathy and Li Tang.