The problem of canonically labeling a graph is studied. Within the general framework of
backtracking algorithms based on individualization and refinement, data structures …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

In this paper, a first systematic review and analysis of the current state of the art pertaining to
complexity problems for a heavily researched class of designs, namely covering arrays, is …

The program plantri is the fastest isomorph-free generator of many classes of planar graphs,
including triangulations, quadrangulations, and convex polytopes. Many applications in the …

EXISTENCE OF q-ANALOGS OF STEINER SYSTEMS Page 1 Forum of Mathematics, Pi (2016),
Vol. 4, e7, 14 pages doi:10.1017/fmp.2016.5 1 EXISTENCE OF q-ANALOGS OF STEINER …

We specify an algorithm to enumerate a minimum complete set of combinatorially non‐
isomorphic orthogonal arrays of given strength t, run‐size N, and level‐numbers of the …

Linear complementary dual codes (shortly LCD codes) are codes whose intersections with
their dual codes are trivial. These codes were first introduced by Massey in 1992 …

A remarkable feature of quantum theory is nonlocality (Bell inequality violations). However,
quantum correlations are not maximally nonlocal, and it is natural to ask whether there are …

We report the results of a computer investigation of sets of mutually orthogonal Latin squares
(MOLS) of small order. For n≤ 9 we:(1) determine the number of orthogonal mates for each …

T his (perfect chapter colorings) contains and completely some background regular codes,
material including on equitable a survey partitions of known results and some original …