DocumentCode :
524438
Title :
Text compression using ambigrams
Author :
Gowtham, S. ; Iyshwarya, G. ; Veluru, Kaushik ; Selvi, A. Tamarai ; Vasudha, J.
Author_Institution :
Comput. Sci. & Eng., Amrita Sch. of Eng., Coimbatore, India
Volume :
4
fYear :
2010
fDate :
22-24 June 2010
Abstract :
The networking field is looking forward to improved and efficient methods in channel utilization. For some text, data recovery becomes indispensable because of the importance of data it holds. Therefore, a lossless decomposition algorithm which is independent of the nature and pattern of text is today´s top concern. Efficiency of algorithms used today varies greatly depending on the nature of text. Such algorithms need some characters to be frequently appearing in the text and randomness in the characters present distorts the consistency to a large extent. This paper brings in the idea of using an art form called ambigram to compress text with consistency in the efficiency of the compression.
Keywords :
steganography; system recovery; text analysis; ambigram; channel utilization; data recovery; lossless decomposition algorithm; steganography; text compression; Art; Computer networks; Computer science; Computer science education; Educational technology; Electronic mail; Lakes; Reflection; Switches; White spaces; Ambigrams; embedded algorithms; encryption; lossless compression; steganography; stego key;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Education Technology and Computer (ICETC), 2010 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-6367-1
Type :
conf
DOI :
10.1109/ICETC.2010.5529630
Filename :
5529630
Link To Document :
بازگشت