GRAY CODES FOR REFLECTION GROUPS

[1] HAMILTONIAN CIRCUITS AND PATHS ON N-CUBE [J]. CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (05): : 557 - &

[2] Afriat Sydney N., 1982, RING LINKED RINGS

[3] AGRAWAL DP, 1976, IEEE T COMPUT, V25, P549, DOI 10.1109/TC.1976.1674648

[4] AN APPROACH FOR GENERATING DIFFERENT TYPES OF GRAY CODES [J]. INFORMATION AND CONTROL, 1984, 63 (1-2): : 1 - 10

[5] Benson C., 1985, FINITE REFLECTION GR, V99

[6] BERLEKAMP E, 1982, WINNING WAYS

[7] EFFICIENT GENERATION OF BINARY REFLECTED GRAY CODE AND ITS APPLICATIONS [J]. COMMUNICATIONS OF THE ACM, 1976, 19 (09) : 517 - 521

[8] Bourbaki N., 1981, GROUPES ALGEBRES LIE

[9] GRAY CODES WITH RESTRICTED DENSITY [J]. DISCRETE MATHEMATICS, 1984, 48 (2-3) : 163 - 171

[10] UPPER BOUND ASSOCIATED WITH ERRORS IN GRAY CODE [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 596 - 596

[1] HAMILTONIAN CIRCUITS AND PATHS ON N-CUBE [J]. CANADIAN MATHEMATICAL BULLETIN, 1966, 9 (05): : 557 - &

[2] Afriat Sydney N., 1982, RING LINKED RINGS

[3] AGRAWAL DP, 1976, IEEE T COMPUT, V25, P549, DOI 10.1109/TC.1976.1674648

[4] AN APPROACH FOR GENERATING DIFFERENT TYPES OF GRAY CODES [J]. INFORMATION AND CONTROL, 1984, 63 (1-2): : 1 - 10

[5] Benson C., 1985, FINITE REFLECTION GR, V99

[6] BERLEKAMP E, 1982, WINNING WAYS

[7] EFFICIENT GENERATION OF BINARY REFLECTED GRAY CODE AND ITS APPLICATIONS [J]. COMMUNICATIONS OF THE ACM, 1976, 19 (09) : 517 - 521

[8] Bourbaki N., 1981, GROUPES ALGEBRES LIE

[9] GRAY CODES WITH RESTRICTED DENSITY [J]. DISCRETE MATHEMATICS, 1984, 48 (2-3) : 163 - 171

[10] UPPER BOUND ASSOCIATED WITH ERRORS IN GRAY CODE [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 596 - 596