Mathematical analysis of various superimposed coding methods

Simon Stiassny

American Documentation, 1960, vol. 11, issue 2, 155-169

Abstract: The chain‐spelling and random‐number superimposed coding methods and their variants are described. It is shown that for a given field and a given number of words to be punched therein, the above methods are equivalent as far as the probability of a match being false is concerned. For the above methods the optimum number of punches per word is 0.693 x (field size) ‐ (number of words punched) and does not depend on the vocabulary size. The staggered superimposed coding method is also described and analyzed. Charts giving the probabilities of a match being false for various vocabulary sizes, field sizes, and numbers of words punched are provided. Tables extending these figures to multi‐word inquiries are included.

Date: 1960
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.5090110209

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:amedoc:v:11:y:1960:i:2:p:155-169

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1936-6108

Access Statistics for this article

American Documentation is currently edited by Javed Mostafa

More articles in American Documentation from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().