TITLE

Information Hiding on Lossless Data Compression

AUTHOR(S)
Yoshioka, Katsunari; Sonoda, Kotaro; Takizawa, Osamu; Matsumoto, Tsutomu
PUB. DATE
April 2008
SOURCE
Journal of Digital Information Management;Apr2008, Vol. 6 Issue 2, p151
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We address a new class of Information hiding on lossless data compression. In our model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information from the compressed data. In this paper, we formally define the above model of information hiding on lossless data compression. Then, we focus on a particular compression method, namely LZSS, which is used in ZIP/LHA. We propose a new method, called IH-LZSS, which controls the trade-off between the maximum embeddable data size and compression rate. Some experimental results are also shown.
ACCESSION #
31859674

 

Related Articles

  • Test Data Compression for Minimum Test Application Time. Po-Chang Tsai; Sying-Jyan Wang; Ching-Hung Lin; Tung-Hua Yeh // Journal of Information Science & Engineering;Nov2007, Vol. 23 Issue 6, p1901 

    In this paper, we proposed a test data compression scheme targeted for minimizing the amount of test data. The proposed scheme can reduce the test application time and minimize the amount of compressed test data, which reduces the size of data memory in ATE and the time needed to transfer test...

  • Coding of Measuring Data by Direct Mapping on the Function. Bogomolov, A. V.; Vlasievsky, S. V.; Levenets, A. V.; En Un Chye // Bulletin of PNU;2012, Vol. 24 Issue 1, p85 

    Coding of data is a primary stage of the processing. The way in which data are coded can influence efficiency of mathematical data processing, their compression, storage, etc. The way of data coding is proposed in the paper that consists in using a function as an image domain for the initial...

  • High Index Compression without the Dependencies of Data Orders and Data Skewness for Spatial Databases. HUNG-YI LIN // Journal of Information Science & Engineering;Mar2011, Vol. 27 Issue 2, p561 

    No abstract available.

  • Using rating matrix compression techniques to speed up collaborative recommendations. Formoso, Vreixo; Fern├índez, Diego; Cacheda, Fidel; Carneiro, Victor // Information Retrieval Journal;Dec2013, Vol. 16 Issue 6, p680 

    Collaborative filtering is a popular recommendation technique. Although researchers have focused on the accuracy of the recommendations, real applications also need efficient algorithms. An index structure can be used to store the rating matrix and compute recommendations very fast. In this...

  • The Compression of the Alphanumeric Information in its Graphic Coding Representation. Dychka, I. A.; Golub, V. I.; Novosad, M. V. // Naukovi visti NTUU - KPI;2011, Vol. 2011 Issue 2, p69 

    We devise the compression method of alphanumeric information in its graphic coding representation. The method of data compression is based on converting data from one alphabet to another -- from the alphabet of characters into alphabet of graphic coding symbols. The method provides the data...

  • A NOVEL CODEBOOK INITIALISATION TECHNIQUE FOR GENERALIZED LLOYD ALGORITHM USING CLUSTER DENSITY. Somasundaram, K.; Vimala, S. // International Journal on Computer Science & Engineering;2010, Vol. 2 Issue 5, p1807 

    In this paper, a novel codebook initialization technique has been adopted for Generalized Lloyd Algorithm (GLA). GLA plays an important role in the design of Vector Quantizers. The proposed technique generates initial seeds in a simple way which reduced the computational complexity when compared...

  • Density Based Clustering using Enhanced KD Tree. Logamani. K.; S. C., Punitha. // International Journal of Computer Science Engineering & Technolo;Nov2014, Vol. 4 Issue 11, p314 

    Clustering is a division of data into groups of similar objects. Each group called cluster, consists of objects that are similar within the cluster and dissimilar to objects of other clusters. Representing data by fewer clusters necessarily loses certain fine details, but achieves...

  • Wavelet trees: a survey. Makris, Christos // Computer Science & Information Systems;Jun2012, Vol. 9 Issue 2, p585 

    The article discusses a study on various characteristics of the wavelet tree data structure. It offers information on the wavelet tree data structure which was originally proposed for text compression applications, but can also be used in text indexing and retrieval. It explores how the study...

  • H-HIBASE: Compression Enhancement of HIBASE Technique Using Huffman Coding. Habib, Ahsan; Hoque, A. S. M. Latiful; Hussain, Md. Russel // Journal of Computers;May2013, Vol. 8 Issue 5, p1175 

    HIBASE compression technique simply replaces the attribute values in a tuple with fixed length code-words. However, fixed length coding system is not an optimal compression technique because some redundancies occur in the compressed table. This redundancy can be avoided if we use Huffman...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics