Search the dblp DataBase

Publications of Author

1. Cornelis Roos, A. Snijders, A. J. van Zanten
   Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1998, v:48, n:, pp:- [Journal]
   
2. A. J. van Zanten
   Cyclic distance-preserving codes on a constant-weight basis. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:289-294 [Journal]
   
3. A. J. van Zanten
   Lexicographic Order and Linearity. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1997, v:10, n:1, pp:85-97 [Journal]
   
4. A. J. van Zanten, Agung Lukito
   Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1999, v:16, n:2, pp:185-199 [Journal]
   
5. A. J. van Zanten, I. Nengah Suparta
   On the Construction of Linear q-ary Lexicodes. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2005, v:37, n:1, pp:15-29 [Journal]
   
6. Cornelis Roos, A. J. van Zanten
   On the existence of certain distance-regular graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:197-212 [Journal]
   
7. Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov
   Binary self-dual codes with automorphisms of composite order. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:311-318 [Journal]
   
8. A. J. van Zanten
   Index system and separability of constant weight Gray codes. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1229-0 [Journal]
   
9. A. J. van Zanten
   Minimal-change order and separability in linear codes. [Citation Graph (0, 0)][DBLP]
   IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1988-0 [Journal]
   
10. A. J. van Zanten, I. Nengah Suparta
    The separability of standard cyclic N-ary Gray codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:485-487 [Journal]
    
11. I. Nengah Suparta, A. J. van Zanten
    Balanced Maximum Counting Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3827-3830 [Journal]
    
12. Cees Roos, A. J. van Zanten
    On the existence of certain generalized Moore geometries, part II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:3, pp:277-282 [Journal]
    
13. Cees Roos, A. J. van Zanten
    On the existence of certain generalized Moore geometries, part I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:2, pp:179-190 [Journal]
    
14. Cees Roos, A. J. van Zanten
    On the existence of certain generalized Moore geometries, part III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:275-283 [Journal]
    
15. Cees Roos, A. J. van Zanten, M. J. Coster
    On the existence of certain generalized moore geometries (Part IV). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:2, pp:139-144 [Journal]
    
16. A. J. van Zanten
    The degree of the eigenvalues of generalized Moore geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:1, pp:89-96 [Journal]
    
17. R. M. Damerell, Cees Roos, A. J. van Zanten
    On the existence of certain generalized Moore geometries, V. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:3, pp:183-189 [Journal]
    
18. A. J. van Zanten
    A short proof of a theorem of bannai and ito. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:78, n:3, pp:321-325 [Journal]
    
19. 
    Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube. [Citation Graph (, )][DBLP]
    
    
20. 
    A construction of Gray codes inducing complete graphs. [Citation Graph (, )][DBLP]