Ajith Shenoy

Ajith Shenoy
Manipal Academy of Higher Education | MAHE · Department of Information and Communication Technology

MSc, M.Tech, PhD


How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
Skills and Expertise
Additional affiliations
September 2003 - October 2017
Manipal Academy of Higher Education
  • Professor


Publications (6)
This article studies the efficacy of the Metropolis algorithm for the minimum-weight codeword problem . The input is a linear code $C$ given by its generator matrix and our task is to compute a nonzero codeword in the code $C$ of least weight. In particular, we study the Metropolis algorithm on two possible search spaces for the problem: 1) t...
Full-text available
This paper describes the efficacy of rearranging and grouping of data bits. Lossless encoding techniques like Huffman Coding, Arithmetic Coding etc., works well on data which contains redundant information. The idea behind these techniques is to encode more frequently occurring symbols with less number of bits and more seldom occurring symbols with...
We study the performance of the Metropolis algorithm for the problem of finding a code word of weight less than or equal to M, given a generator matrix of an [n; κ]-binary linear code. The algorithm uses the set Sκ of all κ × κ invertible matrices as its search space where two elements are considered adjacent if one can be obtained from the other v...
Conference Paper
It is observed that Digital images requires a large amount of memory to store and when retrieved from the internet, can take a considerable amount of time to download. Our method enables us to compress image in such a way that the utilization of memory will be less. The Proposed MSB based hybrid method has good compression rate (more than sixty per...
Conference Paper
Full-text available
In this paper we study the suitability of the Metropolis Algorithm and its generalization for solving the shortest lattice vector problem (SVP). SVP has numerous applications spanning from robotics to computational number theory, viz., polynomial factorization. At the same time, SVP is a notoriously hard problem. Not only it is NP-hard, there is no...


Cited By


Project (1)