数字逻辑（邓建）02-14-16.pptVIP

* * * * * * * * * * * * Hamming distance between x and y is count of positions where x-bit differs from y-bit Also equals link count in shortest path from x to y n-cubes and Distance 0-cube 1-cube 2-cube 0 1 10 00 11 01 3-cube 110 010 111 011 100 000 101 001 4-cube * * Gray code is path that visits each vertex exactly once 3-cube 110 010 111 011 100 000 101 001 4-cube * * Example: N=3  L = {000,111} 000 111 100 010 001 101 110 011 * 奇偶校验码 在每组数据信息上附加一位奇偶校验位，若采用奇校验方式，则使包括校验码在内的数据含有奇数个“1”；偶校验方式，则使包括校验码在内的数据含有偶数个“1”。 例：字母“E”的7位ASCII码为： 1 0 0 0 1 0 1，若在最高位增加一位奇偶校验位，其奇校验编码则为0 1 0 0 0 1 0 1；其偶校验编