De Bruijn cycles for covering codes

A de Bruijn covering code is a q‐ary string S so that every q‐ary string is at most R symbol changes from some n‐word appearing consecutively in S. We introduce these codes and prove that they can have size close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra. Included is a table of the best known bounds on the lengths of small binary de Bruijn covering codes, up to R = 11 and n = 13, followed by several open questions in this area. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

A note on the connectivity of 2-regular digraphs

Let D ₂(n) be the probability space of 2-regular digraphs on n vertices with the uniform measure. As n tends to infinity, the probability that the digraphs are 2-connected tends to 1. © 1993 John Wiley & Sons, Inc.