Further Results in Polynomial Addressing [Letter to the Editor]
Charles V. Freiman, Robert Tien-Wen Chien · IBM Journal of Research and Development · 1963
The problem of efficiently retrieving documents and other information from large-scale memory and file systems has generated much renewed interest in the comparatively old area of “hash-” or key-addressing. Among the more promising approaches taken has been the application of some results of the theory of group codes, as typified by the papers of Schay and Raver1and of Hanan and Palermo.2Common to the work of these authors and some of the earlier work of Muroga3is the idea of choosing a group code of the minimum-distance type and assigning addresses to keys according to the group-code coset in which particular keys fall. The most interesting class of group codes from an implementation point of view is that in which encoding and decoding is accomplished by means of shift-registers for polynomial multiplication and division. We shall restrict our attention to this class and shall refer to the use of such codes as polynomial addressing.