Title :
Counting Sequences with Large Local Distance
Author_Institution :
Department of Computer Science, Brandeis University, Waltham, MA 02254.
fDate :
6/1/1985 12:00:00 AM
Abstract :
The 2n n-bit vectors can be ordered so that any vector in the sequence has some minimum Hamming distance from any vector near it in the sequence.
Keywords :
Computer errors; Computer science; Counting circuits; Electrons; Hamming distance; Redundancy; Code; Hamming distance; counter; sequence;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1985.5009410
