Common coordinates in consecutive addresses

We consider lists of distinct q-ary addresses of length n. We wish that any b consecutive addresses in such a list agree in many positions. We give upper bounds on what can be achieved. Moreover, for each q and n, we give explicit constructions of address lists, among which is the conventional q-ary reflected Gray code, that attain these bounds for all b simultaneously. This work has applications in address retrieval on optical disc.