Browsing by Advisor "Shankar, Priti"
Now showing items 1-9 of 9
-
Computational Problems In Codes On Graphs
(2009-05-11)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 ... -
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ... -
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ... -
Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework
(2009-03-09)This thesis presents a new unified algorithm for cluster assignment and acyclic region scheduling in a partitioned architecture, and preliminary results on its integration into an experimental retargetable code generation ... -
A New Algorithm For Linear Tree Pattern Matching
(2012-05-03) -
New Approaches And Experimental Studies On - Alegebraic Attacks On Stream Ciphers
(2015-02-05)Algebraic attacks constitute an effective class of cryptanalytic attacks which have come up recently. In algebraic attacks, the relations between the input, output and the key are expressed as a system of equations and ... -
A Static Slicing Tool for Sequential Java Programs
(2018-07-28)A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. ...