A New Technique for Text Data Compression

This paper presents how ternary representation of numbers can be utilized to compress text data with fixed-symbol-length coding techniques. We use a binary map for ternary digits and introduce a method to use the binary 11-pair, which has never been use for coding data before, and we further use 4-Digits ternary representation of alphabet with lowercase and uppercase letters. We find a way to minimize the length of the bits string, which is only possible in ternary representation thus efficiently reducing the length of the code. We also find some connection between this technique of coding data and Fibonacci numbers.