The SCEAS System
| |||||||

## Search the dblp DataBase
Tuvi Etzion:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Moshe Schwartz, Tuvi Etzion
**Optimal 2-Dimensional 3-Dispersion Lattices.**[Citation Graph (0, 0)][DBLP] AAECC, 2003, pp:216-225 [Conf] - Alexander Vardy, Tuvi Etzion
**Some Constructions of Perfect Binary Codes.**[Citation Graph (0, 0)][DBLP] AAECC, 1993, pp:344-354 [Conf] - 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] - Sara Bitan, Tuvi Etzion
**On Constructions for Optimal Optical Orthogonal Codes.**[Citation Graph (0, 0)][DBLP] Algebraic Coding, 1993, pp:111-125 [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] - Sara Bitan, Tuvi Etzion
**The Last Packing Number of Quadruples, and Cyclic SQS.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1993, v:3, n:4, pp:283-313 [Journal] - Tuvi Etzion, Victor K. Wei, Zhen Zhang
**Bounds on the Sizes of Constant Weight Covering Codes.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1995, v:5, n:3, pp:217-239 [Journal] - Tuvi Etzion
**An Algorithm for Constructing m-ary de Bruijn Sequences.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1986, v:7, n:3, pp:331-340 [Journal] - Eli Bar-Yahalom, Tuvi Etzion
**Intersection of Isomorphic Linear Codes.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:247-256 [Journal] - Simon R. Blackburn, Tuvi Etzion, Kenneth G. Paterson
**Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:55-82 [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
**Self-dual sequences.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1987, v:44, n:2, pp:288-298 [Journal] - Tuvi Etzion
**Optimal Partitions for Triples.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1992, v:59, n:2, pp:161-176 [Journal] - Tuvi Etzion
**Partitions of Triples into Optimal Packings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1992, v:59, n:2, pp:269-284 [Journal] - Tuvi Etzion, Moshe Schwartz, Alexander Vardy
**Optimal tristance anticodes in certain graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:2, pp:189-224 [Journal] - Moshe Schwartz, Tuvi Etzion
**Codes and Anticodes in the Grassman Graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2002, v:97, n:1, pp:27-42 [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] - Yael Ben-Haim, Tuvi Etzion
**On the Optimality of Coloring with a Lattice.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:18, n:4, pp:844-878 [Journal] - Tuvi Etzion
**Nonequivalent**[Citation Graph (0, 0)][DBLP]*q*-ary Perfect Codes. SIAM J. Discrete Math., 1996, v:9, n:3, pp:413-423 [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] - Tuvi Etzion, Alan Hartman
**Towards a Large Set of Steiner Quadruple Systems.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1991, v:4, n:2, pp:182-195 [Journal] - Tuvi Etzion, Alexander Vardy
**On Perfect Codes and Tilings: Problems and Solutions.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:2, pp:205-223 [Journal] - David Goldfeld, Tuvi Etzion
**UPP Graphs and UMFA Networks-Architecture for Parallel Systems.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1992, v:41, n:11, pp:1479-1483 [Journal] - Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran
**Rotating-Table Games and Derivatives of Words.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:108, n:2, pp:311-329 [Journal] - Tuvi Etzion
**An Algorithm for Generating Shift-Register Cycles.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1986, v:44, n:, pp:209-224 [Journal] - Tuvi Etzion, Michael Yoeli
**Super-Nets and their Hierarchy.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1983, v:23, n:, pp:243-272 [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, Gadi Greenberg
**Constructions for perfect mixed codes and other covering codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:209-0 [Journal] - Tuvi Etzion, Gadi Greenberg, Iiro S. Honkala
**Normal and abnormal codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1453-0 [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] - Tuvi Etzion, Abraham Lempel
**Construction of de Bruijn sequences of minimal complexity.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:705-708 [Journal] - Tuvi Etzion, Beniamin Mounits
**Quasi-perfect codes with small distance.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3938-3946 [Journal] - Tuvi Etzion, Patric R. J. Östergård
**Greedy and Heuristic Algorithms for Codes and Colorings.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:382-388 [Journal] - Tuvi Etzion, Kenneth G. Paterson
**Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3186-3199 [Journal] - Tuvi Etzion, Kenneth G. Paterson
**Near optimal single-track Gray codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:3, pp:779-789 [Journal] - Tuvi Etzion, Moshe Schwartz
**Perfect Constant-Weight Codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2156-2165 [Journal] - Tuvi Etzion, Ari Trachtenberg, Alexander Vardy
**Which codes have cycle-free Tanner graphs?**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2173-2181 [Journal] - Tuvi Etzion, Alexander Vardy
**Two-dimensional interleaving schemes with repetitions: Constructions and bounds.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:428-457 [Journal] - Tuvi Etzion, Alexander Vardy
**Perfect binary codes: constructions, properties, and enumeration.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:754-763 [Journal] - Chris J. Mitchell, Tuvi Etzion, Kenneth G. Paterson
**A method for constructing decodable de Bruijn sequences.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1472-1478 [Journal] - Beniamin Mounits, Tuvi Etzion, Simon Litsyn
**Improved upper bounds on sizes of codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:4, pp:880-886 [Journal] - Cornelis L. M. van Pul, Tuvi Etzion
**New lower bounds for constant weight codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1324-0 [Journal] - Moshe Schwartz, Tuvi Etzion
**Two-dimensional cluster-correcting codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:6, pp:2121-2132 [Journal] - Moshe Schwartz, Tuvi Etzion
**The structure of single-track Gray codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2383-2396 [Journal] - Vitaly Skachek, Tuvi Etzion, Ron M. Roth
**Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:846-851 [Journal] - Roman Talyansky, Tuvi Etzion, Ron M. Roth
**Efficient Code Construction for Certain Two-Dimensional Constraints.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:794-799 [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] - Tuvi Etzion
**Optimal constant weight codes over Z**[Citation Graph (0, 0)][DBLP]_{k}and generalized designs. Discrete Mathematics, 1997, v:169, n:1-3, pp:55-82 [Journal] - Tuvi Etzion
**Hamiltonian decomposition of K**[Citation Graph (0, 0)][DBLP]^{*}_{n}, patterns with distinct differences, and Tuscan squares. Discrete Mathematics, 1990, v:91, n:3, pp:259-276 [Journal] - Tuvi Etzion
**Combinatorial designs with Costas arrays properties.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:93, n:2-3, pp:143-154 [Journal] **Single-Track Gray Codes and Sequences.**[Citation Graph (, )][DBLP]**Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.**[Citation Graph (, )][DBLP]**Problems on Two-Dimensional Synchronization Patterns.**[Citation Graph (, )][DBLP]**New Upper Bounds on A(n,d)**[Citation Graph (, )][DBLP]**Error-Correction of Multidimensional Bursts**[Citation Graph (, )][DBLP]**Coding Theory in Projective Space**[Citation Graph (, )][DBLP]**Construction of Error-Correcting Codes for Random Network Coding**[Citation Graph (, )][DBLP]**Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams**[Citation Graph (, )][DBLP]**On row-by-row coding for 2-D constraints**[Citation Graph (, )][DBLP]**Enumerative Encoding in the Grassmannian Space**[Citation Graph (, )][DBLP]**Folding, Tiling, and Multidimensional Coding**[Citation Graph (, )][DBLP]**High Dimensional Error-Correcting Codes**[Citation Graph (, )][DBLP]**Sequence Folding, Lattice Tiling, and Multidimensional Coding**[Citation Graph (, )][DBLP]**Representation of Subspaces and Enumerative Encoding of the Grassmannian Space**[Citation Graph (, )][DBLP]**Large Constant Dimension Codes and Lexicodes**[Citation Graph (, )][DBLP]**Dense Error-Correcting Codes in the Lee Metric**[Citation Graph (, )][DBLP]**A New Construction for Constant Weight Codes**[Citation Graph (, )][DBLP]**On Perfect Codes in the Johnson Graph**[Citation Graph (, )][DBLP]
Search in 0.349secs, Finished in 0.353secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |