Ardhendu Tripathy recently defended his Ph. D. thesis. He will be starting a postdoc position at the University of Wisconsin, Madison working with Prof. Robert Nowak. He is also the recipient of a Research Excellence Award from Iowa State University. Congratulations Ardhendu!
Keynote talk at the 2018 Australian Communication Theory Workshop
New paper accepted to the IEEE Transactions on Information Theory
A paper titled “Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes” co-authored with Li Tang has been accepted to the IEEE Transactions on Information Theory. Congratulations, Li!
New paper accepted to the ACM Transactions on Modeling and Performance Evaluation of Computing Systems
A paper titled “Mean-Field-Analysis of Coding versus Replication in Large Data Storage Systems” co-authored with Bin Li (Univ. of Rhode Island) and Rayadurgam Srikant (Univ. of Illinois, Urbana-Champaign) has been accepted to the ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS).
Seminar at UC Santa Barbara
Aditya visited and presented a seminar at UCSB titled: “Combinatorial Designs for distributed data storage, function computation and coded caching”.
Invited paper at Asilomar 2017
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.