Publication Type:

Conference Paper

Source:

ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer, Volume 4, Shanghai, p.V4509-V4511 (2010)

ISBN:

9781424463688

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-77956093269&partnerID=40&md5=5583f9fda197d5e69a39d02245ad037b

Keywords:

Algorithms, Ambigrams, Cryptography, Embedded algorithms, Embedded systems, Encryption, Image compression, Lossless compression, Steganography, Stego key

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. © 2010 IEEE.

Notes:

cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@3df20043 ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@5aef4e7a Through org.apache.xalan.xsltc.dom.DOMAdapter@15095a3a; Conference Code:81513

Cite this Research Publication

S. Gowtham, Iyshwarya, G., Kaushik, V., Tamarai, S. A., and Vasudha, J., “Text compression using ambigrams”, in ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer, Shanghai, 2010, vol. 4, pp. V4509-V4511.