On the existence of certain distance-regular graphs. - Cornelis Roos; A. J. van Zanten (J. Comb. Theory B, 1982)

On the existence of certain generalized Moore geometries, part I. - Cees Roos; A. J. van Zanten (Discret. Math., 1984)

On the existence of certain generalized Moore geometries, part II. - Cees Roos; A. J. van Zanten (Discret. Math., 1984)

On the existence of certain generalized Moore geometries, part III. - Cees Roos; A. J. van Zanten (Discret. Math., 1986)

On the existence of certain generalized moore geometries (Part IV). - Cees Roos; A. J. van Zanten; M. J. Coster (Discret. Math., 1986)

The degree of the eigenvalues of generalized Moore geometries. - A. J. van Zanten (Discret. Math., 1987)

On the existence of certain generalized Moore geometries, V. - R. M. Damerell; Cees Roos; A. J. van Zanten (Discret. Math., 1989)

A short proof of a theorem of bannai and ito. - A. J. van Zanten (Discret. Math., 1989)

The complexity of an optimal algorithm for the generalized tower of hanoi problem. - A. J. van Zanten (Int. J. Comput. Math., 1990)

An iterative optimal algorithm for the generalized tower of hanoi problem. - A. J. van Zanten (Int. J. Comput. Math., 1991)

Index system and separability of constant weight Gray codes. - A. J. van Zanten (IEEE Trans. Inf. Theory, 1991)

Minimal-change order and separability in linear codes. - A. J. van Zanten (IEEE Trans. Inf. Theory, 1993)

The ranking problem of a Gray code for compositions. - A. J. van Zanten (Ars Comb., 1995)

Lexicographic Order and Linearity. - A. J. van Zanten (Des. Codes Cryptogr., 1997)

Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. - Cornelis Roos; A. Snijders; A. J. van Zanten (Ars Comb., 1998)

Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics. - A. J. van Zanten; Agung Lukito (Des. Codes Cryptogr., 1999)

Cyclic distance-preserving codes on a constant-weight basis. - A. J. van Zanten (Discret. Appl. Math., 2001)

Vertex Partitions of Hypercubes into Symmetric Snakes. - Agung Lukito; A. J. van Zanten (Electron. Notes Discret. Math., 2002)

The separability of standard cyclic N-ary Gray codes. - A. J. van Zanten; I Nengah Suparta (IEEE Trans. Inf. Theory, 2003)

Binary self-dual codes with automorphisms of composite order. - Radinka Dontcheva; A. J. van Zanten; Stefan M. Dodunekov (IEEE Trans. Inf. Theory, 2004)

On the Construction of Linear q-ary Lexicodes. - A. J. van Zanten; I Nengah Suparta (Des. Codes Cryptogr., 2005)

Balanced Maximum Counting Sequences. - I Nengah Suparta; A. J. van Zanten (IEEE Trans. Inf. Theory, 2006)

Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube. - A. J. van Zanten; Loeky Haryanto (Des. Codes Cryptogr., 2008)

A construction of Gray codes inducing complete graphs. - I Nengah Suparta; A. J. van Zanten (Discret. Math., 2008)

Generalized residue and t-residue codes and their idempotent generators. - A. J. van Zanten; A. Bojilov; Stefan M. Dodunekov (Des. Codes Cryptogr., 2015)

Primitive idempotent tables of cyclic and constacyclic codes. - A. J. van Zanten (Des. Codes Cryptogr., 2019)