UR coding - a novel algorithm for data compression

Data compression is long studied and well researched discipline. Many useful techniques for data compression already exist. The paper presents a novel data compression technique; which, out performs, well established techniques, (i.e., Huffman, Run Length or LZ78 coding techniques) in terms of compression efficiency. UR coding algorithm basically generates a state machine using the symbols as its state. Paths between states are allotted a unique code. We implemented the technique and compared our algorithm with existing well known algorithms. The paper presents the technique, its implementation and results of the experiment done for the comparison purposes.