Accession Number:



Identifying Codes on Directed De Bruijn Graphs

Corporate Author:

Air Force Research Laboratory/RITF ROME United States

Report Date:



For a directed graph G, a t-identifying code is a subset S reflex subset contained in V G with the property that for each vertex v a member V G the set of vertices of S reachable from v by a directed path of length at most t is both non-empty and unique. A graph is called t-identifiable if there exists a t-identifying code. This paper shows that the directed de Bruijn graph Bd, n is t-identifiable for n is greater than or equal to 2t1, and is not t-identifiable for n is less than or equal to 2t2.

Descriptive Note:

OSTP Journal Article

Supplementary Note:

UNKNOWN , 01 Jan 0001, 01 Jan 0001,



Communities Of Interest:

Modernization Areas:

Distribution Statement:

Approved For Public Release;

File Size: