Tuvi Etzion
Tuvi Etzion
Computer Science Department
Technion IIT
Haifa 32000 Israel
etzion@cs.technion.ac.il
Phone (Office) +972-4-8294311
Fax +972-4-8293900
Areas of Interest
Coding Theory
Digital Sequences
Combinatorial Algorithms and Designs in Coding
Coding for Storage Devices
Applications of Discrete Mathematics to Problems in Computer Science and Information Theory
Editorial board
IEEE Transactions on Information Theory
Journal of Combinatorial Designs
Courses
234141
Combinatorics for Computer Science
236516
Digital Sequences in Communication and Coding
236515
Advanced Topics in Coding Theory
Graduate Students
David Goldfeld,
Equivalence of Interconnection Networks,
M.Sc., completed 1989.
Rivka Licht,
Realization of Permutations in Shuffle-Exchange Network,
M.Sc., completed 1990.
Doron Cohen,
Combinatorial Designs Derived from Constant Weight Codes,
M.Sc., completed 1990.
Gadi Greenberg,
Bounds on the Sizes of Covering Codes,
M.Sc., completed 1993.
Sara Bitan,
Lower Bounds on the Sizes of Error-Correcting Codes,
D.Sc., completed 1995.
Ofra Hod,
Constructions of Covering Codes and Error-Correcting Codes,
M.Sc., completed 1996.
Roman Talyansky,
Coding for Two-Dimensional Constraints,
M.Sc., completed 1997.
Vitaly Skachek,
Coding for Spectral-Null Constraints,
M.Sc., completed 1997.
Moshe Schwartz,
Characterization of Single-Track Gray Codes,
M.Sc., completed 1998.
Marina Biberstein,
Constructions and Bounds for Blot-Correcting Codes,
M.Sc., completed 1999.
Yael Merksamer,
Two-Dimensional Cluster Error-Correcting Codes,
M.Sc., completed 2004.
Moshe Schwartz,
Tilings, Anticodes, and Two-Dimensional Coding,
Ph.D., completed 2004.
Beniamin Mounits,
Bounds on the Sizes of Nonlinear Codes,
Ph.D., completed 2006.
Keren Censor,
Constrained Codes for Two-Dimensional Channels,
M.Sc., completed 2006.
Natalia Silberstein,
Properties of Codes in the Johnson Scheme,
M.Sc., completed 2007.
Eitan Yaakobi,
Codes for Correcting Multi-Dimensional Bursts,
M.Sc., completed 2007.
Publications (journals only)
T. Etzion and M. Yoeli,
Super-Nets and their Hierarchy,
Theoretical Computer Science,
23 (1983), 243-272.
pdf
T. Etzion and A. Lempel,
Algorithms for the Generation of Full-length Shift-Register Cycles,
IEEE Trans. Inform. Theory,
IT-30 (1984), 480-484.
pdf
T. Etzion and A. Lempel,
On the Distribution of de Bruijn Sequences of Given Complexity,
IEEE Trans. Inform. Theory,
IT-30 (1984), 611-614.
pdf
T. Etzion and A. Lempel,
Construction of de Bruijn Sequences of Minimal Complexity,
IEEE Trans. Inform. Theory,
IT-30 (1984), 705-709.
pdf
T. Etzion,
On the Distribution of de Bruijn sequences of Low Complexity,
Journal Combinatorial Theory, Series A,
38 (1985), 241-253.
pdf
T. Etzion and A. Lempel,
An Efficient Algorithm for Generating Linear Transformation in a Shuffle-Exchange Network,
SIAM Journal on Computing,
15 (1986), 216-221.
pdf
T. Etzion,
On the Distribution of de Bruijn CR-Sequences,
IEEE Trans. Inform. Theory,
IT-32 (1986), 422-423.
pdf
T. Etzion,
An Algorithm for Generating Shift-Register Cycles,
Theoretical Computer Science,
44 (1986), 209-224.
T. Etzion,
An Algorithm for Constructing m-ary de Bruijn Sequences,
Journal of Algorithms,
7 (1986), 331-340.
pdf
T. Etzion,
Self-dual Sequences,
Journal Combinatorial Theory, Series A,
44 (1987), 288-298.
pdf
T. Etzion,
Constructions for Perfect Maps and Pseudo-Random Arrays,
IEEE Trans. Inform. Theory,
IT-34 (1988), 1308-1316.
pdf
T. Etzion, S. W. Golomb, and H. Taylor,
Tuscan-k Squares,
Advances in Applied Mathematics,
10 (1989), 164-174.
pdf
C. L. M. van Pul and T. Etzion,
New Lower Bounds for Constant Weight Codes,
IEEE Trans. Inform. Theory,
IT-35 (1989), 1324-1329.
pdf
T. Etzion,
Constructions of Error-Correcting DC-Free Block Codes,
IEEE Trans. Inform. Theory,
IT-36 (1990), 899-905.
pdf
S. W. Golomb, T. Etzion, and H. Taylor,
Polygonal Path Constructions for Tuscan-k Squares,
Ars Combinatoria,
30 (1990), 97-140.
T. Etzion and A. Hartman,
Towards a Large Set of Steiner Quadruple Systems,
SIAM Journal on Discrete Mathematics,
4 (1991), 182-195.
pdf
T. Etzion,
Hamiltonian Decomposition of $K_n^*$ Patterns with Distinct Differences, and Tuscan Squares,
Discrete Mathematics,
91 (1991), 259-276.
pdf
T. Etzion,
New Lower Bounds for Asymmetric and Unidirectional Codes,
IEEE Trans. Inform. Theory,
IT-37 (1991), 1696-1704
pdf
(see correction in IT-38 (1992), 1183-1184).
pdf
T. Etzion,
Combinatorial Designs with Costas Arrays Properties,
Discrete Mathematics,
93 (1991), 143-154.
pdf
D. Cohen and T. Etzion,
Row-Complete Latin Squares which are not Column-Complete,
Ars Combinatoria,
32 (1991), 193-201.
pdf
T. Etzion,
Optimal Partitions for Triples,
Journal Combinatorial Theory, Series A,
59 (1992), 161-176.
pdf
T. Etzion,
Partitions of Triples into Optimal Packings,
Journal Combinatorial Theory, Series A,
59 (1992), 269-284.
pdf
T. Etzion,
Optimal Codes for Correcting Single Errors and Detecting Adjacent Errors,
IEEE Trans. Inform. Theory,
IT-38 (1992), 1357-1360.
pdf
R. Bar-Yehuda and T. Etzion,
Connections between Two Cycles - a New Design of Dense Processor Interconnection Networks,
Discrete Applied Mathematics,
37/38 (1992), 29-43.
pdf
T. Etzion and I. Bar-David,
An Explicit Construction of Euler Circuits in Shuffle Nets and Related Networks,
Networks,
22 (1992), 523-529.
pdf
D. Goldfeld and T. Etzion,
UPP Graphs and UMFA Networks - Architecture for Parallel Systems,
IEEE Trans. on Computers,
COM-41 (1992), 1479-1483.
pdf
T. Etzion and G. Greenberg,
Constructions for Perfect Mixed Codes and Other Covering Codes
IEEE Trans. Inform. Theory,
IT-39 (1993), 209-214.
pdf
R. Bar-Yehuda, T. Etzion, and S. Moran,
Rotating-Table Games and Derivatives of Words,
Theoretical Computer Science,
108 (1993), 311-329.
pdf
S. Bitan and T. Etzion,
The Last Packing Number of Quadruples, and Cyclic SQS,
Designs Codes and Cryptography,
3 (1993), 283-313.
pdf
T. Etzion, G. Greenberg, and I. S. Honkala,
Normal and Abnormal Codes,
IEEE Trans. Inform. Theory,
IT-39 (1993), 1453-1456.
pdf
T. Etzion,
Partitions for Quadruples,
Ars Combinatoria,
36 (1993), 296-308.
T. Etzion and A. Vardy,
Perfect Binary Codes: Constructions Properties, and Enumeration,
IEEE Trans. Inform. Theory,
IT-40 (1994), 754-763.
pdf
T. Etzion,
Large Sets of Coverings,
Journal of Combinatorial Designs,
2 (1994), 359-373.
pdf
S. Bitan and T. Etzion,
Constructions for Optimal Constant Weight Cyclically Permutable Codes and Difference Families,
IEEE Trans. Inform. Theory,
IT-41 (1995), 77-87.
pdf
T. Etzion, V. Wei, and Z. Zhang,
Bounds on the Sizes of Constant Weight Covering Codes,
Designs Codes and Cryptography,
5 (1995), 217-239.
pdf
T. Etzion and K. G. Paterson,
Near Optimal Single-Track Gray Codes,
IEEE Trans. Inform. Theory,
IT-42 (1996), 779-789.
pdf
T. Etzion,
On the Nonexistence of Perfect Codes in the Johnson Scheme,
SIAM Journal on Discrete Mathematics,
9 (1996), 201-209.
pdf
T. Etzion,
On Threshold Schemes from Large Sets,
Journal of Combinatorial Designs,
4 (1996), 323-338.
pdf
S. R. Blackburn, T. Etzion, and K. G. Paterson,
Permutation Polynomials, de Bruijn Sequences and Linear Complexity,
Journal of Combinatorial Theory, Series A,
76 (1996), 55-82.
pdf
T. Etzion,
Nonequivalent $q$-ary Perfect Codes,
SIAM Journal on Discrete Mathematics,
9 (1996), 413-423.
pdf
T. Etzion and S. Bitan,
On the Chromatic Number, Coloring, and Codes of the Johnson Graph,
Discrete Applied Mathematics,
70 (1996), 163-175.
pdf
C. J. Mitchell, T. Etzion, and K. G. Paterson,
A Method for Constructing Decodable de Bruijn Sequences,
IEEE Trans. Inform. Theory,
IT-42 (1996), 1472-1478.
pdf
T. Etzion,
Cascading Methods for Runlength-Limited Arrays,
IEEE Trans. Inform. Theory,
IT-43 (1997), 319-324.
pdf
T. Etzion,
Optimal Constant Weight Codes over $Z_k$ and Generalized Designs,
Discrete Mathematics,
169 (1997), 55-82.
pdf
T. Etzion,
The Depth Distribution - a New Characterization for Linear Codes,
IEEE Trans. Inform. Theory,
IT-43 (1997), 1361-1363.
pdf
E. Bar-Yahalom and T. Etzion,
Intersection of Isomorphic Linear Codes,
Journal of Combinatorial Theory, Series A,
80 (1997), 247-256.
pdf
T. Etzion and P. R. J. \"Osterg\aa rd,
Greedy and Heuristic Algorithms for Codes and Colorings,
IEEE Trans. Inform. Theory,
IT-44 (1998), 382-388.
pdf
V. Skachek, T. Etzion, and R. M. Roth,
Efficient Encoding Algorithms for Third-Order Spectral-Null Codes,
IEEE Trans. Inform. Theory,
IT-44 (1998), 846-851.
pdf
T. Etzion and A. Vardy,
On Perfect Codes and Tilings: Problems and Solutions,
SIAM Journal on Discrete Mathematics,
11 (1998), 203-223.
pdf
T. Etzion,
Perfect Byte-Correcting Codes,
IEEE Trans. Inform. Theory,
IT-44 (1998), 3140-3146.
pdf
T. Etzion,
Linear Complexity of de Bruijn Sequences - Old and New Results,
IEEE Trans. Inform. Theory,
IT-45 (March 1999).
pdf
R. Talyansky, T. Etzion, R. M. Roth,
Efficient Code Constructions for Certain Two-Dimensional Constraints,
IEEE Trans. Inform. Theory,
IT-45 (1999), 794-799.
pdf
T. Etzion, A. Trachtenberg, and A. Vardy,
Which Codes Have Cycle-Free Tanner Graphs?
IEEE Trans. Inform. Theory,
IT-45 (1999), 2173-2181.
pdf
M. Schwartz and T. Etzion,
The Structure of Single-Track Gray Codes,
IEEE Trans. Inform. Theory,
IT-45 (1999), 2383-2396.
pdf
M. Biberstein and T. Etzion,
Optimal Codes for Single-Error Correction, Double-Adjacent-Error Detection,
IEEE Trans. Inform. Theory,
IT-46 (2000), 2188-2193.
pdf
T. Etzion,
Constructions for Perfect 2-Burst-Correcting Codes,
IEEE Trans. Inform. Theory,
IT-47 (2001), 1553-1555.
pdf
M. Schwartz and T. Etzion,
Codes and Anticodes in the Grassman Graph,
Journal Combinatorial Theory, Series A,
97 (2002), 27-42.
pdf
T. Etzion and A. Vardy,
Two-Dimensional Interleaving Schemes with Repetitions: constructions and bounds,
IEEE Trans. Inform. Theory,
IT-48 (2002), 428-457.
pdf
B. Mounits, T. Etzion and S. Litsyn,
Improved Upper Bounds on the Sizes of Codes,
IEEE Trans. Inform. Theory,
IT-48 (2002), 880-886.
pdf
T. Etzion and M. Schwartz,
Perfect Constant-Weight Codes,
IEEE Trans. Inform. Theory,
IT-50 (2004), 2156-2165.
pdf
M. Schwartz and T. Etzion,
Two-Dimensional Cluster-Correcting Codes,
IEEE Trans. Inform. Theory,
IT-51 (2005), 2121-2132.
pdf
Y. Ben-Haim and T. Etzion,
On the Optimality of Coloring with a lattice,
SIAM Journal on Discrete Mathematics,
18 (2005), 844-878.
pdf
T. Etzion and K. Paterson,
Zero/Positive Capacities of Two-Dimensional Runlength Constrained Arrays,
IEEE Trans. Inform. Theory,
IT-51 (2005), 3186-3199.
pdf
T. Etzion and B. Mounits,
Quasi-Perfect Codes with Small Distance,
IEEE Trans. Inform. Theory,
IT-51 (2005), 3938-3946.
pdf
T. Etzion, M. Schwartz, and A. Vardy,
Optimal Tristance Anticodes in Certain Graphs,
Journal of Combinatorial Theory, Series A,
113 (2006), 189-224.
pdf
T. Etzion,
On the Stopping Redundancy of Reed-Muller Codes,
IEEE Trans. Inform. Theory,
IT-52 (2006), 4867-4879.
pdf
K. Censor and T. Etzion,
The Positive Capacity Region of Two-Dimensional Run length Constrained Channels,
IEEE Trans. Inform. Theory,
IT-52 (2006), 5128-5140.
pdf
T. Etzion,
Configuration Distribution and Designs of Codes in the Johnson Scheme, Journal of Combinatorial Designs, 15 (2007), 15-34.
pdf
B. Mounits, T. Etzion and S. Litsyn,
New Upper Bounds on Codes via Association Schemes and Linear Programming,
Advances of Mathematics in Communications,
1 (2007), 173-195.
pdf
Your visit here is number
this month
See visit counters for many of the pages
Tuvi Etzion's Home Page,
etzion@cs.technion.ac.il