Publications

Journal Publications

  1. T. Etzion and M. Yoeli, Super-nets and their hierarchy, Theoretical Computer Science, 23 (1983), 243-272. PDF
  2. 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
  3. 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
  4. T. Etzion and A. Lempel, Construction of de Bruijn sequences of minimal complexity, IEEE Trans. Inform. Theory, IT-30 (1984), 705-709. PDF
  5. T. Etzion, On the distribution of de Bruijn sequences of low complexity, Journal Combinatorial Theory, Series A, 38 (1985), 241-253. PDF
  6. 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
  7. T. Etzion, On the distribution of de Bruijn CR-sequences, IEEE Trans. Inform. Theory, IT-32 (1986), 422-423. PDF
  8. T. Etzion, An algorithm for generating shift-register cycles, Theoretical Computer Science, 44 (1986), 209-224. PDF
  9. T. Etzion, An algorithm for constructing m-ary de Bruijn sequences, Journal of Algorithms, 7 (1986), 331-340. PDF
  10. T. Etzion, Self-dual sequences, Journal Combinatorial Theory, Series A, 44 (1987), 288-298. PDF
  11. T. Etzion, Constructions for perfect maps and pseudo-random arrays, IEEE Trans. Inform. Theory, IT-34 (1988), 1308-1316. PDF
  12. T. Etzion, S. W. Golomb, and H. Taylor, Tuscan-k squares, Advances in Applied Mathematics, 10 (1989), 164-174. PDF
  13. 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
  14. T. Etzion, Constructions of error-correcting DC-free block codes, IEEE Trans. Inform. Theory, IT-36 (1990), 899-905. PDF
  15. S. W. Golomb, T. Etzion, and H. Taylor, Polygonal path constructions for Tuscan-k squares, Ars Combinatoria, 30 (1990), 97-140.
  16. T. Etzion and A. Hartman, Towards a large set of Steiner quadruple systems, SIAM Journal on Discrete Mathematics, 4 (1991), 182-195. PDF
  17. T. Etzion, Hamiltonian decomposition of $K_n^*$, patterns with distinct differences, and Tuscan squares, Discrete Mathematics, 91 (1991), 259-276. PDF
  18. 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
  19. T. Etzion, Combinatorial designs with Costas arrays properties, Discrete Mathematics, 93 (1991), 143-154. PDF
  20. D. Cohen and T. Etzion, Row-complete Latin squares which are not column-complete, Ars Combinatoria, 32 (1991), 193-201. PDF
  21. T. Etzion, Optimal  partitions for triples, Journal Combinatorial Theory, Series A, 59 (1992), 161-176. PDF
  22. T. Etzion, Partitions of triples into optimal packings, Journal Combinatorial Theory, Series A, 59 (1992), 269-284. PDF
  23. T. Etzion, Optimal Codes for Correcting Single Errors and Detecting Adjacent Errors, IEEE Trans. Inform. Theory, IT-38 (1992), 1357-1360. PDF
  24. 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
  25. T. Etzion and I. Bar-David, An Explicit Construction of Euler Circuits in Shuffle Nets and Related Networks, Networks, 22 (1992), 523-529. PDF
  26. D. Goldfeld and T. Etzion, UPP Graphs and UMFA Networks – Architecture for Parallel Systems, IEEE Trans. on Computers, COM-41 (1992), 1479-1483. PDF
  27. T. Etzion and G. Greenberg, Constructions for Perfect Mixed Codes and Other Covering Codes IEEE Trans. Inform. Theory, IT-39 (1993), 209-214. PDF
  28. R. Bar-Yehuda, T. Etzion, and S. Moran, Rotating-Table Games and Derivatives of Words, Theoretical Computer Science, 108 (1993), 311-329. PDF
  29. S. Bitan and T. Etzion, The Last Packing Number of Quadruples, and Cyclic SQS, Designs Codes and Cryptography, 3 (1993), 283-313. PDF
  30. T. Etzion, G. Greenberg, and I. S. Honkala, Normal and Abnormal Codes, IEEE Trans. Inform. Theory, IT-39 (1993), 1453-1456. PDF
  31. T. Etzion, Partitions for Quadruples, Ars Combinatoria, 36 (1993), 296-308.
  32. T. Etzion and A. Vardy, Perfect Binary Codes: Constructions Properties, and Enumeration, IEEE Trans. Inform. Theory, IT-40 (1994), 754-763. PDF
  33. T. Etzion, Large Sets of Coverings, Journal of Combinatorial Designs, 2 (1994), 359-373. PDF
  34. 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
  35. 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
  36. T. Etzion and K. G. Paterson, Near Optimal Single-Track Gray Codes, IEEE Trans. Inform. Theory, IT-42 (1996), 779-789. PDF
  37. T. Etzion, On the Nonexistence of Perfect Codes in the Johnson Scheme, SIAM Journal on Discrete Mathematics, 9 (1996), 201-209. PDF
  38. T. Etzion, On threshold schemes from large sets, Journal of Combinatorial Designs, 4 (1996), 323-338. PDF
  39. 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
  40. T. Etzion, Nonequivalent $q$-ary perfect codes, SIAM Journal on Discrete Mathematics, 9 (1996), 413-423. PDF
  41. T. Etzion and S. Bitan, On the chromatic number, coloring, and codes of the Johnson graph, Discrete Applied Mathematics, 70 (1996), 163-175. PDF
  42. 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
  43. T. Etzion, Cascading Methods for Runlength-Limited Arrays, IEEE Trans. Inform. Theory, IT-43 (1997), 319-324. PDF
  44. T. Etzion, Optimal Constant Weight Codes over $Z_k$ and Generalized Designs, Discrete Mathematics, 169 (1997), 55-82. PDF
  45. T. Etzion, The Depth Distribution – a New Characterization for Linear Codes, IEEE Trans. Inform. Theory, IT-43 (1997), 1361-1363. PDF
  46. E. Bar-Yahalom and T. Etzion, Intersection of Isomorphic Linear Codes, Journal of Combinatorial Theory, Series A, 80 (1997), 247-256. PDF
  47. T. Etzion and P. R. J. Ostergard, Greedy and Heuristic Algorithms for Codes and Colorings, IEEE Trans. Inform. Theory, IT-44 (1998), 382-388. PDF
  48. 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
  49. T. Etzion and A. Vardy, On Perfect Codes and Tilings: Problems and Solutions, SIAM Journal on Discrete Mathematics, 11 (1998), 203-223. PDF
  50. T. Etzion, Perfect Byte-Correcting Codes, IEEE Trans. Inform. Theory, IT-44 (1998), 3140-3146. PDF
  51. T. Etzion, Linear Complexity of de Bruijn Sequences – Old and New Results, IEEE Trans. Inform. Theory, IT-45 (1999), 693-698. PDF
  52. 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
  53. T. Etzion, A. Trachtenberg, and A. Vardy, Which Codes Have Cycle-Free Tanner Graphs? IEEE Trans. Inform. Theory, IT-45 (1999), 2173-2181. PDF
  54. M. Schwartz and T. Etzion, The Structure of Single-Track Gray Codes, IEEE Trans. Inform. Theory, IT-45 (1999), 2383-2396. PDF
  55. 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
  56. T. Etzion, Constructions for Perfect 2-Burst-Correcting Codes, IEEE Trans. Inform. Theory, IT-47 (2001), 1553-1555. PDF
  57. M. Schwartz and T. Etzion, Codes and Anticodes in the Grassman Graph, Journal Combinatorial Theory, Series A, 97 (2002), 27-42. PDF
  58. T. Etzion and A. Vardy, Two-dimensional interleaving schemes with repetitions: constructions and bounds, IEEE Trans. Inform. Theory, IT-48 (2002), 428-457. PDF
  59. 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
  60. T. Etzion and M. Schwartz, Perfect Constant-Weight Codes, IEEE Trans. Inform. Theory, IT-50 (2004), 2156-2165. PDF
  61. M. Schwartz and T. Etzion, Two-Dimensional Cluster-Correcting Codes, IEEE Trans. Inform. Theory, IT-51 (2005), 2121-2132. PDF
  62. Y. Ben-Haim and T. Etzion, On the Optimality of Coloring with a lattice, SIAM Journal on Discrete Mathematics, 18 (2005), 844-878. PDF
  63. T. Etzion and K. Paterson, Zero/Positive Capacities of Two-Dimensional Runlength Constrained Arrays, IEEE Trans. Inform. Theory, IT-51 (2005), 3186-3199. PDF
  64. T. Etzion and B. Mounits, Quasi-Perfect Codes with Small Distance, IEEE Trans. Inform. Theory, IT-51 (2005), 3938-3946. PDF
  65. T. Etzion, M. Schwartz, and A. Vardy, Optimal Tristance Anticodes in Certain Graphs, Journal of Combinatorial Theory, Series A, 113 (2006), 189-224. PDF
  66. T. Etzion, On the Stopping Redundancy of Reed-Muller Codes, IEEE Trans. Inform. Theory, IT-52 (2006), 4867-4879. PDF
  67. 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
  68. T. Etzion, Configuration Distribution and Designs of Codes in the Johnson Scheme, Journal of Combinatorial Designs, 15 (2007), 15-34. PDF
  69. 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
  70. T. Etzion, Optimal Doubly Constant Weight Codes, Journal of Combinatorial Designs, 16 (2008), 137–151. PDF
  71. S. B. Blackburn, T. Etzion, and S.-L. Ng, Prolific Codes with the Identifiable Parent Property, SIAM Journal on Discrete mathematics, 22 (2008), 1393–1410. PDF
  72. S. B. Blackburn, T. Etzion, D. R. Stinson, and G. M. Zaverucha, A Bound on the Size of Separating Hash Families, Journal of Combinatorial Theory, Series A, 115 (2008), 1246–1256. PDF
  73. T. Etzion and E. Yaakobi, Error-Correction of Multidimensional Bursts, IEEE Trans. Inform. Theory, IT-55 (2009), 961–976. PDF
  74. T. Etzion, and N. Silberstein, Error-Correcting Codes in Projective Spaces via RankMetric Codes and Ferrers Diagrams, IEEE Trans. Inform. Theory, IT-55 (2009), 2909– 2919. PDF
  75. I. Tal, T. Etzion, and R. Roth, On row-by-row coding for 2-D constraints, IEEE Trans. Inform. Theory, IT-55 (2009), 3565–3576. PDF
  76. T. Etzion, N. Kalouptsidisy, N. Kolokotronisy, K. Limniotisy, and K. G. Paterson, Properties of the error linear complexity spectrum, IEEE Trans. Inform. Theory, IT-55 (2009), 4681–4686. PDF
  77. S. R. Blackburn, T. Etzion, K. M. Martin, and M. B. Paterson, Two-dimensional Patterns with distinct differences – constructions, bounds, and maximal anticodes, IEEE Trans. Inform. Theory, IT-56 (2010), 1216–1229. PDF
  78. S. B. Blackburn, T. Etzion, and S.-L. Ng, Traceability codes, Journal of Combinatorial Theory, Series A, 117 (2010), 1049–1057. PDF
  79. S. R. Blackburn, T. Etzion, K. M. Martin, and M. B. Paterson, Distinct difference configurations: multihop paths and key predistribution in sensor networks, IEEE Trans. Inform. Theory, IT-56 (2010), 3961–3972. PDF
  80. N. Silberstein and T. Etzion, Enumerative Coding for Grassmannian Space, IEEE Trans. Inform. Theory. IT-57 (2011), 365–374. PDF
  81. T. Etzion and A. Vardy, Error-Correcting Codes in Projective Space, IEEE Trans. Inform. Theory, IT-57 (2011), 1165–1173. PDF
  82. T. Etzion and A. Vardy, q-Analogs for Steiner Systems and Covering Designs, Advances of Mathematics in Communications, 5 (2011), 161–176. PDF
  83. N. Silberstein and T. Etzion, Large Constant Dimension Codes and Lexicodes, Advances of Mathematics in Communications, 5 (2011), 177–189. PDF
  84. T. Etzion, Sequence Folding, Lattice Tiling, and Multidimensional Coding, IEEE Trans. Inform. Theory, IT-57 (2011), 4383–4400. PDF
  85. A. E. Brouwer and T. Etzion, Some New distance-4 Constant Weight Codes, Advances of Mathematics in Communications, 5 (2011), 417–424. PDF
  86. T. Etzion, Product Constructions for Perfect Lee Codes, IEEE Trans. Inform. Theory, IT-57 (2011), 7473–7481. PDF
  87. A. M. Bruckstein, T. Etzion, R. Giryes, N. Gordon, R. J. Holt, and D. Shuldiner, Simple and robust binary self-location patterns, IEEE Trans. Inform. Theory, IT- 58 (2012), 4884–4889. PDF
  88. S. R. Blackburn and T. Etzion, The asymptotic behavior of Grassmannian codes, IEEE Trans. Inform. Theory, IT-58 (2012), 6605–6609. PDF
  89. M. Braun, T. Etzion, and A. Vardy, Linearity and Complements in Projective Space, Linear Algebra and its Applications, 438 (2013), 57–70. PDF
  90. T. Etzion and N. Silberstein, Codes and Designs Related to Lifted MRD Codes, IEEE Trans. Inform. Theory, IT-59 (2013), 1004–1017. PDF
  91. S. Buzaglo and T. Etzion, Tilings with n-Dimensional Chairs and their Applications to Asymmetric Codes, IEEE Trans. Inform. Theory, IT-59 (2013), 1573–1582. PDF
  92. S. Buzaglo and T. Etzion, Tilings by (0.5, n)-Crosses and Perfect Codes, SIAM Journal on Discrete Mathematics, 27 (2013), 1067–1081. PDF
  93. T. Etzion, A. Vardy, and E. Yaakobi, Coding for the Lee and Manhattan Metrics with Weighing Matrices, IEEE Trans. Inform. Theory, IT-59 (2013), 6712–6723. PDF
  94. T. Etzion, Covering of Subspaces by Subspaces, Designs Codes and Cryptography, 72 (2014), 405–421. PDF
  95. T. Etzion, Partial k-Parallelisms in Finite Projective Spaces, Journal of Combinatorial Designs, DOI 10.1002/jcd.21392. PDF
  96. T. Etzion, The q-Analog of the Middle Levels Problem, Discrete Mathematics, 331 (2014), 109–116. PDF
  97. M. Horovitz and T. Etzion, Constructions of Snake-in-the-Box Codes for Rank Modulation, IEEE Trans. Inform. Theory, IT-60 (2014), 7016–7025. PDF
  98. N. Presman, O. Shapira, S. Litsyn, T. Etzion, and A. Vardy, Binary Polarization Kernels from Code Decompositions, IEEE Trans. Inform. Theory, IT-61 (2015), 2227– 2239. PDF
  99. T. Etzion and N. Raviv, Equidistant Codes in the Grassmannian, Discrete Applied Mathematics, 186 (2015) 87-97. PDF
  100. S. Buzaglo and T. Etzion, Bounds on the Size of Permutation Codes with the Kendall’s τ-Metric, IEEE Trans. Inform. Theory, IT-61 (2015), 3241-3250. PDF
  101. N. Silberstein and T. Etzion, Optimal Fractional Repetition Codes based on Graphs and Designs, IEEE Trans. Inform. Theory, IT-61 (2015), 4164-4180. PDF
  102. T. Etzion and L. Storme, Galois geometries and coding theory, Designs, Codes, and Cryptography, 78 (2016), 311-350. PDF
  103. E. Ben-Sasson, T. Etzion, A. Gabizon, and N. Raviv, Subspace polynomials and Cyclic Subspace Codes, IEEE Trans. Inform. Theory, IT-62 (2016), 1157-1165.
  104. T. Etzion, E. Gorla, A. Ravagnani, and A. Wachter-Zeh, Optimal Ferrers Diagram Rank-Metric Codes, IEEE Trans. Inform. Theory,  IT-62 (2016), 1616-1630.
  105. S. Buzaglo, E. Yaakobi, T. Etzion, and S. Bruck, Systematic Error-Correcting Codes for Permutations and Multi-Permutations, IEEE Trans. Inform. Theory,  IT-62 (2016), 3113-3124.
  106. M. Braun, T. Etzion, P. R. J. Ostergard, A. Vardy, and A. Wassermann, Existence of q-Analogs of Steiner Systems, Forum of Mathematics, Pi, 4, e7 (2016), 1-14.
  107. T. Etzion, Regular graphs with forbidden subgraphs of $K_n$ with k edges, International Journal of Information and Coding Theory, 4 (2017), 145–158.
  108. N. Raviv, N. Silberstein, and T. Etzion, Constructions of High-Rate Minimum Storage Regenerating Codes over Small Fields, IEEE Trans. Inform. Theory, IT-63 (2017), 2015–2037.
  109. Y. M. Chee, T. Etzion, H. M. Kiah, and A. Vardy, Cooling Codes: ThermalManagement Coding for High-Performance Interconnects, IEEE Trans. Inform. Theory, IT-64 (2018), 3062–3085.
  110. T. Etzion, M. Firer, and A. Machado, Metrics Based on Finite Directed Graphs and Coding Invariants, IEEE Trans. Inform. Theory, IT-64 (2018), 2398–2409.
  111. T. Etzion and A. Wachter-Zeh, Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding, IEEE Trans. Inform. Theory, IT-64 (2018), 2460–2473.
  112. T. Etzion and N. Hooker, Residual q-Fano Planes and Related Structures, 25 (2018), #P2.3.
  113. T. Etzion, A New Approach for Examining q-Steiner Systems, The Electronic Journal of Combinatorics, 25 (2018), #P2.8.
  114. M. Horovitz and T. Etzion, Local Rank Modulation for Flash Memories, IEEE Trans. Inform. Theory, IT-65 (2019), 1705–1713.
  115. N. Silberstein, T. Etzion, and M. Schwartz, Locality and Availability of Array Codes Constructed from Subspaces, IEEE Trans. Inform. Theory, IT-65 (2019), 2648–2660.
  116. T. Etzion and H. Zhang, Grassmannian codes with new distance measures for network coding, IEEE Trans. Inform. Theory, IT-65 (2019), 4131–4142.
  117. S. R. Blackburn and T. Etzion, PIR array codes with optimal virtual server rate, IEEE Trans. Inform. Theory, IT-65 (2019), 6136–6145.
  118. S. R. Blackburn, T. Etzion, and M. B. Paterson, PIR xchemes with small download complexity and low storage requirements, IEEE Trans. Inform. Theory, IT-66 (2020), 557–571.
  119. T. Etzion, S. Kurz, K. Otal, and F. Ozbudak, Subspace packings – Constructions and Bounds, Designs, Codes, and Cryptography, to appear.
  120. Y. M. Chee, T. Etzion, H. M. Kiah, A. Vardy, and H. Wei, Low-power cooling codes with efficient encoding and decoding, IEEE Trans. Inform. Theory, to appear.
  121. Y. Zhang, T. Etzion, and E. Yaakobi, Bounds on the length of functional PIR and batch codes, IEEE Trans. Inform. Theory, to appear.
  122. T. Etzion and J. Zhou, An improved recursive construction for disjoint Steiner quadruple systems, Journal of Combinatorial Designs, to appear.