NONRANDOM BINARY SUPERIMPOSED CODES
NONRANDOM BINARY SUPERIMPOSED CODES
复制标题
DOI：
10.1109/tit.1964.1053689
复制
发表时间：
1964-01-01
影响因子：
2.5
通讯作者：
SINGLETON, RC
中科院分区：
文献类型：
--
作者：
KAUTZ, WH;SINGLETON, RC
二进制叠加码由一组码字组成，这些码字的逐位布尔和具有规定的可重复性。这些代码发现它们的主要应用在表示的文档属性内的信息检索系统，但也可能被用作信道分配的基础，以缓解拥挤的通信频带中的拥塞。本文给出了这类非随机码的一些基本性质，并导出了与码的主要参数有关的公式和界。最后，描述了几种基于（1）二元常规纠错码，（2）组合安排，如块设计和拉丁方，（3）图形结构，和（4）标准二元纠错码的奇偶校验矩阵的码族。
A binary superimposed code consists of a set of code words whose digit-by-digit Boolean sumsenjoy 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)-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.