Abstract. This Paper essentially reflects on representing a unique way of compressing data, using the concept of Parallel Binary Representation. Parallel Binary Representation is a unique concept, which focuses on representing binary sequences in parallel, based on the higher frequency of data which is to be compressed. Data Compression in this methodology works as allocating data of higher frequencies at the beginning of the Parallel Binary Representation following the data of lower frequencies. This Paper analyzes famous Huffman Coding which is widely being used for Data Compression. Also, this paper emphasizes and focuses on the result which retrieves data encoding for both Huffman Coding and Parallel Binary Representation. Mathematically it has been proven in this paper that, the unique concept of Parallel Binary Representation achieves higher compression rate than Huffman Coding