Design and implementation of algorithm to construct instantaneous code

This paper investigates and presents a novel algorithm to construct instantaneous code, the merit of which is that it needs not construct code tree, and uses array to store information source symbols, and retrieve the code words by dealing with the position in which the information source symbol is stored in the array. With further study, we establish the relationship between the storage position and the sorting of its probability in all symbols. Also, we design the algorithm to compute the position in which the symbol will be stored, and can gain code words from the sorting of its probability.