Techniques of Directory Decoding
David Lefkovitz · 1969
F our of the decoding techniques shown in Fig. 27 are to be described and analyzed. There are (1) the truncated fixed length keyword tree, (2) the unique truncation variable length key-word tree, (3) the complete variable length key-word tree, and (4) the randomizer. For convenience these descriptions will be shortened to the fixed tree, truncated variable tree, variable tree , and randomized methods, respectively. The procedure followed will be to describe and illustrate the methods of each, then to formulate expressions for retrieval time and storage requirements, and finally to compare them with respect to programming complexity, decoding speed, and memory requirement.