论文部分内容阅读
为了方便于复数旋转码编码和译码,定义了旋转运算矩阵,阐明了它的一些主要特性。可以证明,一个用(p~2+p(d—1),p~2,d)表示的素数P阶复数旋转码具有最小码距d,它可以检出达p+1位错,或着纠正达(p+1)/2位错。其编码步骤和译码原则均十分简单,以致能够制造成一种检错纠错能力可调式编码译码两用装置。所得结果适合于计算机网络中分组报文交换用。
In order to facilitate the encoding and decoding of complex rotation codes, a rotation matrix is defined and some of its main features are clarified. It can be shown that a prime P-dimensional complex rotation code denoted by (p ~ 2 + p (d-1), p ~ 2, d) has a minimum code distance d that can detect p + 1 dislocations, Correct up to (p + 1) / 2 dislocations. The encoding steps and decoding principles are very simple, so that it can be made into a kind of error-correcting and error-correcting encoding and decoding dual-purpose device. The result is suitable for packet message exchange in computer network.