IDEAS home Printed from https://ideas.repec.org/a/bla/amedoc/v11y1960i2p155-169.html
   My bibliography  Save this article

Mathematical analysis of various superimposed coding methods

Author

Listed:
  • Simon Stiassny

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.

Suggested Citation

  • Simon Stiassny, 1960. "Mathematical analysis of various superimposed coding methods," American Documentation, Wiley Blackwell, vol. 11(2), pages 155-169, April.
    • Handle: RePEc:bla:amedoc:v:11:y:1960:i:2:p:155-169
    DOI: 10.1002/asi.5090110209
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.5090110209
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.5090110209?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:amedoc:v:11:y:1960:i:2:p:155-169. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.