Generating cyclically permutable codes (Corresp.)
Generating cyclically permutable codes (Corresp.)
复制标题
生成循环可置换代码(对应)
DOI:
10.1109/tit.1974.1055243
复制
发表时间:
1974
影响因子:
2.5
通讯作者:
C. Wolverton
中科院分区:
文献类型:
--
作者:
D. E. Maracle;C. Wolverton
Large sets of cyclically permutable (or cyclically inequivalent) codewords can be created by interleaving the cyclic shifts of several shorter words and selecting a cyclically inequivalent subset from the resulting set, This correspondence presents an efficient algorithm for generating the cyclically inequivalent subset directly.