| 2009 |
|---|
| 77 | EE | Natalia Silberstein,
Tuvi Etzion:
Enumerative Encoding in the Grassmannian Space
CoRR abs/0903.1556: (2009) |
| 76 | EE | Tuvi Etzion:
Folding, Tiling, and Multidimensional Coding
CoRR abs/0903.1724: (2009) |
| 75 | EE | Tuvi Etzion,
Eitan Yaakobi:
Error-Correction of Multidimensional Bursts.
IEEE Transactions on Information Theory 55(3): 961-976 (2009) |
| 2008 |
|---|
| 74 | EE | Simon R. Blackburn,
Tuvi Etzion,
Keith M. Martin,
Maura B. Paterson:
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.
ICITS 2008: 54-69 |
| 73 | EE | Natalia Silberstein,
Tuvi Etzion:
Coding Theory in Projective Space
CoRR abs/0805.3528: (2008) |
| 72 | EE | Tuvi Etzion,
Natalia Silberstein:
Construction of Error-Correcting Codes for Random Network Coding
CoRR abs/0807.2440: (2008) |
| 71 | EE | Tuvi Etzion,
Natalia Silberstein:
Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams
CoRR abs/0807.4846: (2008) |
| 70 | EE | Ido Tal,
Tuvi Etzion,
Ron M. Roth:
On row-by-row coding for 2-D constraints
CoRR abs/0808.0596: (2008) |
| 69 | EE | Simon R. Blackburn,
Tuvi Etzion,
Douglas R. Stinson,
Gregory M. Zaverucha:
A bound on the size of separating hash families.
J. Comb. Theory, Ser. A 115(7): 1246-1256 (2008) |
| 2007 |
|---|
| 68 | EE | Tuvi Etzion:
Single-Track Gray Codes and Sequences.
SSC 2007: 129-133 |
| 67 | EE | Tuvi Etzion,
Eitan Yaakobi:
Error-Correction of Multidimensional Bursts
CoRR abs/0712.4096: (2007) |
| 2006 |
|---|
| 66 | EE | Tuvi Etzion:
On the Stopping Redundancy of Reed-Muller Codes.
IEEE Transactions on Information Theory 52(11): 4867-4879 (2006) |
| 65 | EE | K. Censor,
Tuvi Etzion:
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels.
IEEE Transactions on Information Theory 52(11): 5128-5140 (2006) |
| 64 | EE | Tuvi Etzion,
Moshe Schwartz,
Alexander Vardy:
Optimal tristance anticodes in certain graphs.
J. Comb. Theory, Ser. A 113(2): 189-224 (2006) |
| 2005 |
|---|
| 63 | EE | Beniamin Mounits,
Tuvi Etzion,
Simon Litsyn:
New Upper Bounds on A(n,d)
CoRR abs/cs/0508107: (2005) |
| 62 | EE | Tuvi Etzion,
Beniamin Mounits:
Quasi-perfect codes with small distance.
IEEE Transactions on Information Theory 51(11): 3938-3946 (2005) |
| 61 | EE | Moshe Schwartz,
Tuvi Etzion:
Two-dimensional cluster-correcting codes.
IEEE Transactions on Information Theory 51(6): 2121-2132 (2005) |
| 60 | EE | Tuvi Etzion,
Kenneth G. Paterson:
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays.
IEEE Transactions on Information Theory 51(9): 3186-3199 (2005) |
| 59 | EE | Yael Ben-Haim,
Tuvi Etzion:
On the Optimality of Coloring with a Lattice.
SIAM J. Discrete Math. 18(4): 844-878 (2005) |
| 2004 |
|---|
| 58 | | Tuvi Etzion,
Moshe Schwartz:
Perfect Constant-Weight Codes.
IEEE Transactions on Information Theory 50(9): 2156-2165 (2004) |
| 2003 |
|---|
| 57 | EE | Moshe Schwartz,
Tuvi Etzion:
Optimal 2-Dimensional 3-Dispersion Lattices.
AAECC 2003: 216-225 |
| 2002 |
|---|
| 56 | | Tuvi Etzion,
Alexander Vardy:
Two-dimensional interleaving schemes with repetitions: Constructions and bounds.
IEEE Transactions on Information Theory 48(2): 428-457 (2002) |
| 55 | | Beniamin Mounits,
Tuvi Etzion,
Simon Litsyn:
Improved upper bounds on sizes of codes.
IEEE Transactions on Information Theory 48(4): 880-886 (2002) |
| 54 | EE | Moshe Schwartz,
Tuvi Etzion:
Codes and Anticodes in the Grassman Graph.
J. Comb. Theory, Ser. A 97(1): 27-42 (2002) |
| 2001 |
|---|
| 53 | | Tuvi Etzion:
Constructions for perfect 2-burst-correcting codes.
IEEE Transactions on Information Theory 47(6): 2553-2555 (2001) |
| 2000 |
|---|
| 52 | | Marina Biberstein,
Tuvi Etzion:
Optimal codes for single-error correction, double-adjacent-error detection.
IEEE Transactions on Information Theory 46(6): 2188-2193 (2000) |
| 1999 |
|---|
| 51 | | Tuvi Etzion:
Linear Complexity of de Brujin Sequences - Old and New Results.
IEEE Transactions on Information Theory 45(2): 693-698 (1999) |
| 50 | | Roman Talyansky,
Tuvi Etzion,
Ron M. Roth:
Efficient Code Construction for Certain Two-Dimensional Constraints.
IEEE Transactions on Information Theory 45(2): 794-799 (1999) |
| 49 | | Tuvi Etzion,
Ari Trachtenberg,
Alexander Vardy:
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory 45(6): 2173-2181 (1999) |
| 48 | | Moshe Schwartz,
Tuvi Etzion:
The structure of single-track Gray codes.
IEEE Transactions on Information Theory 45(7): 2383-2396 (1999) |
| 1998 |
|---|
| 47 | | Tuvi Etzion,
Patric R. J. Östergård:
Greedy and Heuristic Algorithms for Codes and Colorings.
IEEE Transactions on Information Theory 44(1): 382-388 (1998) |
| 46 | | Vitaly Skachek,
Tuvi Etzion,
Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
IEEE Transactions on Information Theory 44(2): 846-851 (1998) |
| 45 | | Tuvi Etzion:
Perfect Byte-Correcting Codes.
IEEE Transactions on Information Theory 44(7): 3140-3146 (1998) |
| 44 | EE | Tuvi Etzion,
Alexander Vardy:
On Perfect Codes and Tilings: Problems and Solutions.
SIAM J. Discrete Math. 11(2): 205-223 (1998) |
| 1997 |
|---|
| 43 | EE | Tuvi Etzion:
Optimal constant weight codes over Zk and generalized designs.
Discrete Mathematics 169(1-3): 55-82 (1997) |
| 42 | | Tuvi Etzion:
Cascading methods for runlength-limited arrays.
IEEE Transactions on Information Theory 43(1): 319-323 (1997) |
| 41 | | Tuvi Etzion:
The depth distribution-a new characterization for linear codes.
IEEE Transactions on Information Theory 43(4): 1361-1363 (1997) |
| 40 | EE | Eli Bar-Yahalom,
Tuvi Etzion:
Intersection of Isomorphic Linear Codes.
J. Comb. Theory, Ser. A 80(2): 247-256 (1997) |
| 1996 |
|---|
| 39 | EE | Tuvi Etzion,
Sara Bitan:
On the Chromatic Number, Colorings, and Codes of the Johnson Graph.
Discrete Applied Mathematics 70(2): 163-175 (1996) |
| 38 | | Tuvi Etzion,
Kenneth G. Paterson:
Near optimal single-track Gray codes.
IEEE Transactions on Information Theory 42(3): 779-789 (1996) |
| 37 | | Chris J. Mitchell,
Tuvi Etzion,
Kenneth G. Paterson:
A method for constructing decodable de Bruijn sequences.
IEEE Transactions on Information Theory 42(5): 1472-1478 (1996) |
| 36 | EE | Simon R. Blackburn,
Tuvi Etzion,
Kenneth G. Paterson:
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.
J. Comb. Theory, Ser. A 76(1): 55-82 (1996) |
| 35 | EE | Tuvi Etzion:
On the Nonexistence of Perfect Codes in the JohnsonScheme.
SIAM J. Discrete Math. 9(2): 201-209 (1996) |
| 34 | EE | Tuvi Etzion:
Nonequivalent q-ary Perfect Codes.
SIAM J. Discrete Math. 9(3): 413-423 (1996) |
| 1995 |
|---|
| 33 | | Tuvi Etzion,
Victor K. Wei,
Zhen Zhang:
Bounds on the Sizes of Constant Weight Covering Codes.
Des. Codes Cryptography 5(3): 217-239 (1995) |
| 32 | | Sara Bitan,
Tuvi Etzion:
Constructions for optimal constant weight cyclically permutable codes and difference families.
IEEE Transactions on Information Theory 41(1): 77-87 (1995) |
| 1994 |
|---|
| 31 | | Tuvi Etzion,
Alexander Vardy:
Perfect binary codes: constructions, properties, and enumeration.
IEEE Transactions on Information Theory 40(3): 754-763 (1994) |
| 1993 |
|---|
| 30 | | Alexander Vardy,
Tuvi Etzion:
Some Constructions of Perfect Binary Codes.
AAECC 1993: 344-354 |
| 29 | | Sara Bitan,
Tuvi Etzion:
On Constructions for Optimal Optical Orthogonal Codes.
Algebraic Coding 1993: 111-125 |
| 28 | | Sara Bitan,
Tuvi Etzion:
The Last Packing Number of Quadruples, and Cyclic SQS.
Des. Codes Cryptography 3(4): 283-313 (1993) |
| 27 | | Tuvi Etzion,
Gadi Greenberg:
Constructions for perfect mixed codes and other covering codes.
IEEE Transactions on Information Theory 39(1): 209- (1993) |
| 26 | | Tuvi Etzion,
Gadi Greenberg,
Iiro S. Honkala:
Normal and abnormal codes.
IEEE Transactions on Information Theory 39(4): 1453- (1993) |
| 25 | | Reuven Bar-Yehuda,
Tuvi Etzion,
Shlomo Moran:
Rotating-Table Games and Derivatives of Words.
Theor. Comput. Sci. 108(2): 311-329 (1993) |
| 1992 |
|---|
| 24 | EE | Reuven Bar-Yehuda,
Tuvi Etzion:
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.
Discrete Applied Mathematics 37/38: 29-43 (1992) |
| 23 | | David Goldfeld,
Tuvi Etzion:
UPP Graphs and UMFA Networks-Architecture for Parallel Systems.
IEEE Trans. Computers 41(11): 1479-1483 (1992) |
| 22 | | Tuvi Etzion:
Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704).
IEEE Transactions on Information Theory 38(3): 1183- (1992) |
| 21 | | Tuvi Etzion:
Optimal codes for correcting single errors and detecting adjacent errors.
IEEE Transactions on Information Theory 38(4): 1357- (1992) |
| 20 | | Tuvi Etzion:
Optimal Partitions for Triples.
J. Comb. Theory, Ser. A 59(2): 161-176 (1992) |
| 19 | | Tuvi Etzion:
Partitions of Triples into Optimal Packings.
J. Comb. Theory, Ser. A 59(2): 269-284 (1992) |
| 1991 |
|---|
| 18 | EE | Tuvi Etzion:
Combinatorial designs with Costas arrays properties.
Discrete Mathematics 93(2-3): 143-154 (1991) |
| 17 | | Tuvi Etzion:
New lower bounds for asymmetric and unidirectional codes.
IEEE Transactions on Information Theory 37(6): 1696- (1991) |
| 16 | | Tuvi Etzion,
Alan Hartman:
Towards a Large Set of Steiner Quadruple Systems.
SIAM J. Discrete Math. 4(2): 182-195 (1991) |
| 1990 |
|---|
| 15 | EE | Tuvi Etzion:
Hamiltonian decomposition of K*n, patterns with distinct differences, and Tuscan squares.
Discrete Mathematics 91(3): 259-276 (1990) |
| 14 | | Tuvi Etzion:
Constructions of error-correcting DC-free block codes.
IEEE Transactions on Information Theory 36(4): 899- (1990) |
| 1989 |
|---|
| 13 | | Cornelis L. M. van Pul,
Tuvi Etzion:
New lower bounds for constant weight codes.
IEEE Transactions on Information Theory 35(6): 1324- (1989) |
| 1988 |
|---|
| 12 | | Tuvi Etzion:
Constructions for perfect maps and pseudorandom arrays.
IEEE Transactions on Information Theory 34(5): 1308-1316 (1988) |
| 1987 |
|---|
| 11 | EE | Tuvi Etzion:
Self-dual sequences.
J. Comb. Theory, Ser. A 44(2): 288-298 (1987) |
| 1986 |
|---|
| 10 | | Tuvi Etzion:
On the distribution of de Bruijn CR-sequences.
IEEE Transactions on Information Theory 32(3): 422- (1986) |
| 9 | | Tuvi Etzion:
An Algorithm for Constructing m-ary de Bruijn Sequences.
J. Algorithms 7(3): 331-340 (1986) |
| 8 | | Tuvi Etzion,
Abraham Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
SIAM J. Comput. 15(1): 216-221 (1986) |
| 7 | | Tuvi Etzion:
An Algorithm for Generating Shift-Register Cycles.
Theor. Comput. Sci. 44: 209-224 (1986) |
| 1985 |
|---|
| 6 | | Tuvi Etzion:
On the Distribution of de Bruijn Sequences of Low Complexity.
J. Comb. Theory, Ser. A 38(2): 241-253 (1985) |
| 1984 |
|---|
| 5 | | Tuvi Etzion,
Abraham Lempel:
Algorithms for the generation of full-length shift-register sequences.
IEEE Transactions on Information Theory 30(3): 480-484 (1984) |
| 4 | | Tuvi Etzion,
Abraham Lempel:
On the distribution of de Bruijn sequences of given complexity.
IEEE Transactions on Information Theory 30(4): 611-614 (1984) |
| 3 | | Tuvi Etzion,
Abraham Lempel:
Construction of de Bruijn sequences of minimal complexity.
IEEE Transactions on Information Theory 30(5): 705-708 (1984) |
| 1983 |
|---|
| 2 | | Tuvi Etzion,
Michael Yoeli:
Super-Nets and their Hierarchy.
Theor. Comput. Sci. 23: 243-272 (1983) |
| 1982 |
|---|
| 1 | | Michael Yoeli,
Tuvi Etzion:
Behavioral Equivalence of Concurrent Systems.
European Workshop on Applications and Theory of Petri Nets 1982: 292-305 |
