论文部分内容阅读
本文提出了一种以 S(U,V)阵列为特征的差错控制编码新方法。作者试图借助于集合的组合论来建立具有普遍意义的编码方法。研究结果表明,许多人们熟知的好码,如汉明码、扩展汉明码、戈莱码、一类BCH 码,和一些新码字如异元组合码、复数旋转码、扩展复数旋转码等,都可以很方便地由 S(U,V)阵列在给定的编码约束条件下构造出来。因此,本文所介绍的集合组合论是寻求一种统一编码方法的甚有希望的途径。
In this paper, a novel error control coding method based on S (U, V) arrays is proposed. The author attempts to establish a universal coding method by means of the combinatorial theory of sets. The results show that many well-known good codes, such as Hamming code, Hamming code, Golay code, a class of BCH codes, and some new code words such as compound codes, complex rotation codes, extended complex rotation codes, etc. It is convenient to construct S (U, V) arrays under given coding constraints. Therefore, the set combinatorics described in this paper is a promising way to find a uniform coding method.