Now showing items 1-7 of 7
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 ...
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences
In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ...
Computational Problems In Codes On Graphs
Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ...
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 ...
On Perception-Based Image Compression Schemes