Michael Yoeli, Tuvi Etzion Behavioral Equivalence of Concurrent Systems. [Citation Graph (0, 0)][DBLP] European Workshop on Applications and Theory of Petri Nets, 1982, pp:292-305 [Conf]
Reuven Bar-Yehuda, Tuvi Etzion Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:37, n:, pp:29-43 [Journal]
Tuvi Etzion, Sara Bitan On the Chromatic Number, Colorings, and Codes of the Johnson Graph. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:70, n:2, pp:163-175 [Journal]
Tuvi Etzion On the Distribution of de Bruijn Sequences of Low Complexity. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:241-253 [Journal]
Tuvi Etzion, Abraham Lempel An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:1, pp:216-221 [Journal]
Tuvi Etzion On the Nonexistence of Perfect Codes in the JohnsonScheme. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:2, pp:201-209 [Journal]
Marina Biberstein, Tuvi Etzion Optimal codes for single-error correction, double-adjacent-error detection. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:2188-2193 [Journal]
Sara Bitan, Tuvi Etzion Constructions for optimal constant weight cyclically permutable codes and difference families. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:77-87 [Journal]
Tuvi Etzion Constructions for perfect 2-burst-correcting codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2553-2555 [Journal]
Tuvi Etzion On the distribution of de Bruijn CR-sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:422-0 [Journal]
Tuvi Etzion Constructions for perfect maps and pseudorandom arrays. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1308-1316 [Journal]
Tuvi Etzion Constructions of error-correcting DC-free block codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:4, pp:899-0 [Journal]
Tuvi Etzion New lower bounds for asymmetric and unidirectional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1696-0 [Journal]
Tuvi Etzion Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
Tuvi Etzion Optimal codes for correcting single errors and detecting adjacent errors. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1357-0 [Journal]
Tuvi Etzion Cascading methods for runlength-limited arrays. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:1, pp:319-323 [Journal]
Tuvi Etzion The depth distribution-a new characterization for linear codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1361-1363 [Journal]
Tuvi Etzion Perfect Byte-Correcting Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3140-3146 [Journal]
Tuvi Etzion Linear Complexity of de Brujin Sequences - Old and New Results. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:693-698 [Journal]
Tuvi Etzion, Abraham Lempel Algorithms for the generation of full-length shift-register sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:3, pp:480-484 [Journal]
Tuvi Etzion, Abraham Lempel On the distribution of de Bruijn sequences of given complexity. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:611-614 [Journal]
K. Censor, Tuvi Etzion The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5128-5140 [Journal]
Tuvi Etzion On the Stopping Redundancy of Reed-Muller Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:4867-4879 [Journal]