Description: 1. Problem Description for a given positive integer n, Gray code to meet a coding sequence of the following conditions: (1) a coding sequence of the 2n, each code is of length n binary bit string. (2) without the same coding sequence. (3) position of the sequence adjacent to exactly one of two different codes. For example: n = 2 when the Gray code is: (00, 01, 11, 10).
To Search:
File list (Check if you may need any files):
ge.cpp
105072008100 杨业良 2.doc
Download