default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. J. van Zanten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2019
[j26]A. J. van Zanten:
Primitive idempotent tables of cyclic and constacyclic codes. Des. Codes Cryptogr. 87(6): 1199-1225 (2019)- 2015
- [j25]A. J. van Zanten, A. Bojilov, Stefan M. Dodunekov:
Generalized residue and t-residue codes and their idempotent generators. Des. Codes Cryptogr. 75(2): 315-334 (2015) - 2008
- [j24]A. J. van Zanten, Loeky Haryanto:
Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube. Des. Codes Cryptogr. 48(3): 207-229 (2008) - [j23]I Nengah Suparta
, A. J. van Zanten:
A construction of Gray codes inducing complete graphs. Discret. Math. 308(18): 4124-4132 (2008) - 2006
- [j22]I Nengah Suparta, A. J. van Zanten:
Balanced Maximum Counting Sequences. IEEE Trans. Inf. Theory 52(8): 3827-3830 (2006) - 2005
- [j21]A. J. van Zanten, I Nengah Suparta:
On the Construction of Linear q-ary Lexicodes. Des. Codes Cryptogr. 37(1): 15-29 (2005) - 2004
- [j20]Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov:
Binary self-dual codes with automorphisms of composite order. IEEE Trans. Inf. Theory 50(2): 311-318 (2004) - 2003
- [j19]A. J. van Zanten, I Nengah Suparta:
The separability of standard cyclic N-ary Gray codes. IEEE Trans. Inf. Theory 49(2): 485-487 (2003) - 2002
- [j18]Agung Lukito, A. J. van Zanten:
Vertex Partitions of Hypercubes into Symmetric Snakes. Electron. Notes Discret. Math. 11: 459-467 (2002) - 2001
- [j17]A. J. van Zanten:
Cyclic distance-preserving codes on a constant-weight basis. Discret. Appl. Math. 114(1-3): 289-294 (2001) - 1999
- [j16]A. J. van Zanten, Agung Lukito:
Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics. Des. Codes Cryptogr. 16(2): 185-199 (1999) - 1998
- [j15]Cornelis Roos, A. Snijders, A. J. van Zanten:
Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. Ars Comb. 48 (1998) - 1997
- [j14]A. J. van Zanten:
Lexicographic Order and Linearity. Des. Codes Cryptogr. 10(1): 85-97 (1997) - 1995
- [j13]A. J. van Zanten:
The ranking problem of a Gray code for compositions. Ars Comb. 41 (1995) - 1993
- [j12]A. J. van Zanten:
Minimal-change order and separability in linear codes. IEEE Trans. Inf. Theory 39(6): 1988-1989 (1993) - 1991
- [j11]A. J. van Zanten:
An iterative optimal algorithm for the generalized tower of hanoi problem. Int. J. Comput. Math. 39(3-4): 163-168 (1991) - [j10]A. J. van Zanten:
Index system and separability of constant weight Gray codes. IEEE Trans. Inf. Theory 37(4): 1229-1233 (1991) - 1990
- [j9]A. J. van Zanten:
The complexity of an optimal algorithm for the generalized tower of hanoi problem. Int. J. Comput. Math. 36(1-2): 1-8 (1990) - 1989
- [j8]R. M. Damerell, Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, V. Discret. Math. 76(3): 183-189 (1989) - [j7]A. J. van Zanten:
A short proof of a theorem of bannai and ito. Discret. Math. 78(3): 321-325 (1989) - 1987
- [j6]A. J. van Zanten:
The degree of the eigenvalues of generalized Moore geometries. Discret. Math. 67(1): 89-96 (1987) - 1986
- [j5]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part III. Discret. Math. 58(3): 275-283 (1986) - [j4]Cees Roos, A. J. van Zanten, M. J. Coster:
On the existence of certain generalized moore geometries (Part IV). Discret. Math. 62(2): 139-144 (1986) - 1984
- [j3]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part I. Discret. Math. 51(2): 179-190 (1984) - [j2]Cees Roos, A. J. van Zanten:
On the existence of certain generalized Moore geometries, part II. Discret. Math. 51(3): 277-282 (1984) - 1982
- [j1]Cornelis Roos, A. J. van Zanten:
On the existence of certain distance-regular graphs. J. Comb. Theory B 33(3): 197-212 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
