In this paper a two Special Huffman Tree (SHT) algorithms have been designed and implemented to be encoded with an MPEG video file instead of the standard Huffman tree algorithm. The first SHT has been built with 89-entries, and the other with 100-entries. The SHTs are encrypted using part of the key-stream generated by Rabbit algorithm. The other part of the key-stream is used in insertion operation. In this latter operation, a number of bits of the key-stream are inserted in the coded desired file. The encrypted SHTs with the encoded desired file are sent to the receiver, so no one knows the tree used to encode the file except the sender and the receiver. Many types of tests and measurements (such as efficiency, compression, speed, and security measurements) have been performed to evaluate the performance of this algorithm. Calculation of the compression efficiency of SHTs has been found to be higher than that of the standard Huffman tree. Also, it has been shown that the increasing ratio in size of the generated file to that of the original file is very small and can be neglected.