| List decoding of polar codes I Tal, A Vardy IEEE Transactions on Information Theory 61 (5), 2213-2226, 2015 | 2873 | 2015 |
| Closest point search in lattices E Agrell, T Eriksson, A Vardy, K Zeger IEEE Transactions on Information Theory 48 (8), 2201-2214, 2002 | 1897 | 2002 |
| How to construct polar codes I Tal, A Vardy IEEE Transactions on Information Theory 59 (10), 6562-6582, 2013 | 1087 | 2013 |
| Algebraic soft-decision decoding of Reed-Solomon codes R Koetter, A Vardy IEEE Transactions on Information Theory 49 (11), 2809-2825, 2003 | 869 | 2003 |
| Achieving the secrecy capacity of wiretap channels using polar codes H Mahdavifar, A Vardy IEEE Transactions on Information Theory 57 (10), 6428-6443, 2011 | 651 | 2011 |
| The intractability of computing the minimum distance of a code A Vardy IEEE Transactions on Information Theory 43 (6), 1757-1766, 1997 | 566 | 1997 |
| Fast polar decoders: Algorithm and implementation G Sarkis, P Giard, A Vardy, C Thibeault, WJ Gross IEEE Journal on Selected Areas in Communications 32 (5), 946-957, 2014 | 520 | 2014 |
| Hardware architectures for successive cancellation decoding of polar codes C Leroux, I Tal, A Vardy, WJ Gross 2011 IEEE International Conference on Acoustics, Speech and Signal …, 2011 | 348 | 2011 |
| Error-correcting codes in projective space T Etzion, A Vardy IEEE Transactions on Information Theory 57 (2), 1165-1173, 2011 | 335 | 2011 |
| MDS array codes with independent parity symbols M Blaum, J Bruck, A Vardy IEEE Transactions on Information Theory 42 (2), 529-542, 1996 | 330 | 1996 |
| Semantic security for the wiretap channel M Bellare, S Tessaro, A Vardy Advances in Cryptology–CRYPTO 2012, 294-311, 2012 | 256 | 2012 |
| Correcting errors beyond the Guruswami-Sudan radius in polynomial time F Parvaresh, A Vardy Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium …, 2005 | 248 | 2005 |
| Which codes have cycle-free Tanner graphs? T Etzion, A Trachtenberg, A Vardy IEEE Transactions on Information Theory 45 (6), 2173-2181, 1999 | 237 | 1999 |
| Which codes have cycle-free Tanner graphs? T Etzion, A Trachtenberg, A Vardy Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on, 207, 1998 | 237* | 1998 |
| Minimal tail-biting trellises: The Golay code and more AR Calderbank, GD Forney, A Vardy IEEE Transactions on Information Theory 45 (5), 1435-1455, 1999 | 223 | 1999 |
| Upper bounds for constant-weight codes E Agrell, A Vardy, K Zeger IEEE Transactions on Information Theory 46 (7), 2373-2395, 2000 | 220 | 2000 |
| Fast List Decoders for Polar Codes G Sarkis, P Giard, A Vardy, C Thibeault, WJ Gross IEEE Journal on Selected Areas in Communications 34 (2), 318-328, 2016 | 218 | 2016 |
| On the stopping distance and the stopping redundancy of codes M Schwartz, A Vardy IEEE Transactions on Information Theory 52 (3), 922-932, 2006 | 213 | 2006 |
| Trellis structure of codes A Vardy Handbook of coding theory, 1998 | 203 | 1998 |
| Algorithmic complexity in coding theory and the minimum distance problem A Vardy 29-th Annual ACM Symposium on Theory of Computing (STOC'97), 92-109, 1997 | 188 | 1997 |
tuvi etzionComputer Science, Technion, IsraelVerified email at cs.technion.ac.il
