#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1982

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- A. J. van Zanten
- Des. Codes Cryptography
- 1997

- Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov
- IEEE Transactions on Information Theory
- 2004

In this paper, we present some results concerning a decomposition of binary self-dual codes having an automorphism of an order which is the product of two odd prime numbers. These results are applied to construct self-dual [72,36,12] codes with an automorphism of order 15. Furthermore, it is proved that the automorphism group of a putative binary extremal… (More)

- A. J. van Zanten
- IEEE Trans. Information Theory
- 1993

A linear code E? is said to he in minimal-change order if each codeword differs from its predecessor by a word of minimum weight. A rule is presented to construct such an order in case that i? has a basis of codewords with minimum weight. Some consequences concem-ing the ranking and separability in 5 F are mentioned. It is well known that the set of all… (More)

- A. J. van Zanten
- IEEE Trans. Information Theory
- 1991

1229 compression of files of information retrieval systems. With this application in mind, bounds on the average codelength of an alphabetical code were studied. The major results of this correspondence are as follows. 1) A necessary and sufficient condition for the existence of a 2) An upper bound for Lopt (the average codelength of the binary alphabetical… (More)

- I. Nengah Suparta, A. J. van Zanten
- IEEE Transactions on Information Theory
- 2006

In this correspondence, we discuss a modified version of a method due to Bakos and, independently, to Robinson and Cohn for the construction of Gray sequences. We make use of this construction to prove the existence of so-called balanced cyclic half Gray sequences. Furthermore, we discuss a specific type of counting sequences, called maximum counting… (More)

- A. J. van Zanten, Agung Lukito
- Des. Codes Cryptography
- 1999

- A. J. van Zanten
- Ars Comb.
- 1995

- A. J. van Zanten
- Discrete Mathematics
- 1989

- A. J. van Zanten, I. Nengah Suparta
- Des. Codes Cryptography
- 2005

- A. J. van Zanten, I. Nengah Suparta
- IEEE Trans. Information Theory
- 2003

—A Sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance , in the standard-ary Gray code of length , for 1 and for even values of. The bound generalizes a similar result in the binary case.