zbMATH — the first resource for mathematics

Nonrandom binary superimposed codes. (English) Zbl 0133.12402
Authors’ summary: A binary superimposed code consists of a set of code words whose digit-by-digit Boolean sums \((1+1=1)\) enjoy a prescribed level of distinguishability. These codes find their main application in the representation of document attributes within an information retrieval system, but might also be used as a basis for channel assignments to relieve congestion in crowded communications bands. In this paper some basic properties of nonrandom codes of this family are presented, and formulas and bounds relating the principal code parameters are derived. Finally, there are described several such code families based upon (1) \(q\)-nary conventional error-correcting codes, (2) combinatorial arrangements, such as block designs and Latin squares, (3) a graphical construction, and (4) the parity-check matrices of standard binary error-correcting codes.
Reviewer: J. Dénes

94B60 Other types of codes
68P20 Information storage and retrieval of data
Full Text: DOI