Samar Sen Sarma

Debajit Sensarma, Samar Sen Sarma

Data hiding has received much attention due to rapid development of internet and multimedia technologies where security of information is a very important concern. This is achieved by Steganography, which is the art or science of hiding data into another data, so that human eyes cannot catch the hidden information easily. There are many ways to hide information-like inside an image, text, audio/ video etc. Among them image steganography is a very attractive research area. The goal is to transmit a data within a modified image (called stego-image)by minimizing the number of bit flips. In this paper, a new steganography technique has been proposed using Graphical codes and also comparison with steganography technique using BCH codes has been studied.

Sounak Sadhukhan, Samar Sen Sarma

In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path. The path may be shortest route in practical life, either physical or electronic medium. The scenario is to represents the ambiance as a graph and to find a spanning tree with custom design criteria. Here, we have chosen a minimum degree spanning tree, which can be generated in real time with minimum turnaround time. The problem is NP-complete in nature [1, 2]. The solution approach, in general, is approximate. We have used a heuristic approach, namely hybrid genetic algorithm (GA), with motivated criteria of encoded data structures of graph. We compare the experimental result with the existing approximate algorithm and the result is so encouraging that we are interested to use it in our future applications.