INDEX SYSTEM AND SEPARABILITY OF CONSTANT WEIGHT GRAY CODES

被引：12
作者：
VANZANTEN, AJ
机构：
[1] Department of Mathematics and Informatics, Delft University of Technology, 2628, BL Delft
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 04期
关键词：
GRAY CODES; CONSTANT WEIGHT CODES; INDEX SYSTEM; RANKING PROBLEM; NUMBER SYSTEM; SEPARABILITY;
D O I：
10.1109/18.86981
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A number system is developed for the conversion of natural numbers to the codewords of the Gray code G(n,k) of length n and weight k, and vice versa. As an application sharp lower and upper bounds are derived for the value of \i-j\, where i and j are indices of codewords g(i) and g(j) of G(n,k) such that they differ in precisely 2m bits.
引用
收藏
页码：1229 / 1233
页数：5
相关论文
共 13 条
[1]  
Bennett WR., 1965, DATA TRANSMISSION
[2]   EFFICIENT GENERATION OF BINARY REFLECTED GRAY CODE AND ITS APPLICATIONS [J].
BITNER, JR ;
EHRLICH, G ;
REINGOLD, EM .
COMMUNICATIONS OF THE ACM, 1976, 19 (09) :517-521
[3]   UPPER BOUND ASSOCIATED WITH ERRORS IN GRAY CODE [J].
CAVIOR, SR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) :596-596
[4]  
EHRLICH G, 1973, JACM, V3, P500
[5]  
FILL JA, 1977, SOLUTIONS MANUAL COM
[6]   NOTE ON GRAY CODE AND ODD-EVEN MERGE [J].
FLAJOLET, P ;
RAMSHAW, L .
SIAM JOURNAL ON COMPUTING, 1980, 9 (01) :142-158
[7]  
Gardner M., 1959, MATH PUZZLES DIVERSI
[8]  
Graham R. L., 1989, CONCRETE MATH
[9]  
KNUTH DE, 1969, FUNDAMENTAL ALGORITH
[10]  
MANSOUR II, 1975, IEEE T INFORM THEORY, V21, P596
12