Error-correcting codes in projective space T Etzion, A Vardy IEEE Transactions on Information Theory 57 (2), 1165-1173, 2011 | 297 | 2011 |
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams T Etzion, N Silberstein IEEE Transactions on Information Theory 55 (7), 2909-2919, 2009 | 234 | 2009 |
Which codes have cycle-free Tanner graphs? T Etzion, A Trachtenberg, A Vardy IEEE Transactions on Information Theory 45 (6), 2173-2181, 1999 | 229 | 1999 |
Perfect binary codes: constructions, properties, and enumeration T Etzion, A Vardy IEEE Transactions on Information Theory 40 (3), 754-763, 1994 | 169 | 1994 |
Construction of de Bruijn sequences of minimal complexity T Etzion, A Lempel IEEE Transactions on Information Theory 30 (5), 705-709, 1984 | 160* | 1984 |
Constructions for perfect maps and pseudorandom arrays T Etzion IEEE Transactions on information theory 34 (5), 1308-1316, 1988 | 152 | 1988 |
Constructions for optimal constant weight cyclically permutable codes and difference families S Bitan, T Etzion IEEE Transactions on Information Theory 41 (1), 77-87, 1995 | 146 | 1995 |
Existence of-analogs of Steiner systems M Braun, T Etzion, PRJ Östergård, A Vardy, A Wassermann Forum of Mathematics, Pi 4, e7, 2016 | 145 | 2016 |
Codes and designs related to lifted MRD codes T Etzion, N Silberstein IEEE Transactions on Information Theory 59 (2), 1004-1017, 2012 | 135 | 2012 |
Algorithms for the generation of full-length shift-register sequences T Etzion, A Lempel IEEE Transactions on Information Theory 30 (3), 480-484, 1984 | 126 | 1984 |
On perfect codes and tilings: Problems and solutions T Etzion, A Vardy SIAM Journal on Discrete Mathematics 11 (2), 205-223, 1998 | 118 | 1998 |
Galois geometries and coding theory T Etzion, L Storme Designs, Codes and Cryptography 78, 311-350, 2016 | 114* | 2016 |
Codes and anticodes in the Grassman graph M Schwartz, T Etzion Journal of Combinatorial Theory, Series A 97 (1), 27-42, 2002 | 95 | 2002 |
Optimal constant weight codes over Zk and generalized designs T Etzion Discrete Mathematics 169 (1-3), 55-82, 1997 | 84 | 1997 |
Optimal fractional repetition codes based on graphs and designs N Silberstein, T Etzion IEEE Transactions on Information Theory 61 (8), 4164-4180, 2015 | 74* | 2015 |
Subspace polynomials and cyclic subspace codes E Ben-Sasson, T Etzion, A Gabizon, N Raviv IEEE Transactions on Information Theory 62 (3), 1157-1165, 2016 | 73 | 2016 |
The depth distribution-a new characterization for linear codes T Etzion IEEE Transactions on Information Theory 43 (4), 1361-1363, 1997 | 65 | 1997 |
Constructions of high-rate minimum storage regenerating codes over small fields N Raviv, N Silberstein, T Etzion IEEE Transactions on Information Theory 63 (4), 2015-2038, 2017 | 64* | 2017 |
Bounds on the Size of Permutation Codes With the Kendall -Metric S Buzaglo, T Etzion IEEE Transactions on Information Theory 61 (6), 3241-3250, 2015 | 64* | 2015 |
Product constructions for perfect Lee codes T Etzion IEEE Transactions on Information Theory 57 (11), 7473-7481, 2011 | 64* | 2011 |