In a balanced code each codeword contains equally many 1's and 0's. Parallel decoding balanced codes with 2/sup r/ (or 2/sup r/-1) information bits are presented, where r is the number of check bits. The 2/sup 2/-r-1 construction given by D.E. Knuth (ibid., vol.32, no.1, p.51-3, 1986) is improved. The new codes are shown to be optimal when Knuth's complementation method is used.
展开▼
机译:在平衡代码中,每个码字包含相等的1和0。提出了具有2 / sup r /(或2 / sup r / -1)信息位的并行解码平衡码,其中r是校验位的数量。 D.E.给出的2 / sup 2 / -r-1结构Knuth(同上,第32卷,第1期,第51-3页,1986年)得到了改进。当使用Knuth的补码方法时,新代码被证明是最佳的。
展开▼