Now showing items 1-6 of 6
Codes With Locality For Distributed Data Storage
This thesis deals with the problem of code design in the setting of distributed storage systems consisting of multiple storage nodes, storing many different data les. A primary goal in such systems is the efficient repair ...
Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability
In this thesis, three problems have been considered and new coding schemes have been devised for each of them. The first is related to distributed function computation, the second to coding for distributed storage and the ...
Classical Binary Codes And Subspace Codes in a Lattice Framework
The classical binary error correcting codes, and subspace codes for error correction in random network coding are two different forms of error control coding. We identify common features between these two forms and study ...
Diversity-Mutiplexing Tradeoff Of Asynchronous Cooperative Relay Networks And Diversity Embedded Coding Schemes
This thesis consists of two parts addressing two different problems in fading channels. The first part deals with asynchronous cooperative relay communication. The assumption of nodes in a cooperative communication relay ...
Guessing And Compression : A Large Deviations Approach
The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of ...