![]() | ![]() |
2008 | ||
---|---|---|
5 | EE | I. Nengah Suparta, A. J. van Zanten: A construction of Gray codes inducing complete graphs. Discrete Mathematics 308(18): 4124-4132 (2008) |
2006 | ||
4 | EE | I. Nengah Suparta, A. J. van Zanten: Balanced Maximum Counting Sequences. IEEE Transactions on Information Theory 52(8): 3827-3830 (2006) |
2005 | ||
3 | EE | A. J. van Zanten, I. Nengah Suparta: On the Construction of Linear q-ary Lexicodes. Des. Codes Cryptography 37(1): 15-29 (2005) |
2 | EE | I. Nengah Suparta: A Simple Proof for the Existence of Exponentially Balanced Gray Codes. Electr. J. Comb. 12: (2005) |
2003 | ||
1 | A. J. van Zanten, I. Nengah Suparta: The separability of standard cyclic N-ary Gray codes. IEEE Transactions on Information Theory 49(2): 485-487 (2003) |
1 | A. J. van Zanten | [1] [3] [4] [5] |