The following pages link to A. J. van Zanten (Q226494):
Displaying 48 items.
- Lexicographic order and linearity (Q676694) (← links)
- A short proof of a theorem of Bannai and Ito (Q752725) (← links)
- On the existence of certain generalized Moore geometries. I (Q798661) (← links)
- On the existence of certain generalized Moore geometries. II (Q798662) (← links)
- On the existence of certain generalized Moore geometries. V (Q908929) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- Constacyclic codes as invariant subspaces (Q959893) (← links)
- Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube (Q1009043) (← links)
- On the existence of certain generalized Moore geometries. III (Q1076677) (← links)
- On the existence of certain generalized Moore geometries. IV (Q1088670) (← links)
- The degree of the eigenvalues of generalized Moore geometries (Q1119664) (← links)
- On the existence of certain distance-regular graphs (Q1165872) (← links)
- Construction of certain cyclic distance-preserving codes having linear-algebraic characteristics (Q1299916) (← links)
- Primitive idempotent tables of cyclic and constacyclic codes (Q2416930) (← links)
- On the construction of linear \(q\)-ary lexicodes. (Q2572975) (← links)
- (Q2715949) (← links)
- (Q2768131) (← links)
- (Q3115559) (← links)
- (Q3139573) (← links)
- (Q3201756) (← links)
- An iterative optimal algorithm for the generalized tower of hanoi problem (Q3348426) (← links)
- Index system and separability of constant weight Gray codes (Q3360805) (← links)
- The complexity of an optimal algorithm for the generalized tower of hanoi problem (Q3479521) (← links)
- Binary Self-Dual Codes With Automorphisms of Composite Order (Q3546814) (← links)
- Balanced Maximum Counting Sequences (Q3547995) (← links)
- (Q3669454) (← links)
- (Q3783324) (← links)
- (Q3838725) (← links)
- (Q3960871) (← links)
- (Q3973745) (← links)
- (Q3973746) (← links)
- (Q4016874) (← links)
- (Q4268142) (← links)
- Minimal-change order and separability in linear codes (Q4307479) (← links)
- (Q4456872) (← links)
- (Q4501025) (← links)
- (Q4664686) (← links)
- (Q4664713) (← links)
- The separability of standard cyclic N-ary Gray codes (Q4679924) (← links)
- (Q4702351) (← links)
- (Q4739933) (← links)
- (Q4750673) (← links)
- (Q4865123) (← links)
- (Q4936735) (← links)
- (Q5219866) (← links)
- (Q5708597) (← links)
- (Q5715090) (← links)
- Cyclic distance-preserving codes on a constant-weight basis (Q5954098) (← links)