There are a variety of data compression techniques spanning almost sixty years, such of these techniques are statistical and dictionary compression techniques. A more sophisticated and efficient lossless statistical compression technique is known as “Huffman Coding”, in which the characters in a data file are converted to a binary code, It has provided a foundation upon which other data compression techniques have built and a benchmark to which they may be compared. On the other hand, Dictionary techniques use a paradigm where several consecutive symbols are replaced by a single code. In this paper a hybrid technique is proposed for the data compression by taking benefit from the advantages of Huffman and dictionary compression techniques. In the proposed technique, short codes are assigned for patterns and letters occurred more frequently and long codes are assigned for patterns and letters occurred less frequently. The proposed technique yields best results than classic techniques, which helps in reducing the data storage capacity and data-transmission bandwidth to interact with the capabilities and requirements of available technologies.