| 2009 |
|---|
| 70 | EE | Eitan Yaakobi,
Alexander Vardy,
Paul H. Siegel,
Jack K. Wolf:
Multidimensional Flash Codes
CoRR abs/0901.0702: (2009) |
| 2008 |
|---|
| 69 | EE | Junsheng Han,
Paul H. Siegel,
Alexander Vardy:
Improved Probabilistic Bounds on Stopping Redundancy.
IEEE Transactions on Information Theory 54(4): 1749-1753 (2008) |
| 2007 |
|---|
| 68 | EE | Jun Ma,
Alexander Vardy,
Zhongfeng Wang,
Qinqin Chen:
Direct Root Computation Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes.
ISCAS 2007: 1409-1412 |
| 67 | EE | Jun Ma,
Alexander Vardy,
Zhongfeng Wang:
Low-Latency Factorization Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes.
IEEE Trans. VLSI Syst. 15(11): 1225-1238 (2007) |
| 2006 |
|---|
| 66 | EE | Moshe Schwartz,
Alexander Vardy:
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems.
AAECC 2006: 225-234 |
| 65 | EE | Jun Ma,
Alexander Vardy,
Zhongfeng Wang:
Efficient fast interpolation architecture for soft-decision decoding of Reed-Solomon codes.
ISCAS 2006 |
| 64 | EE | Jun Ma,
Alexander Vardy,
Zhongfeng Wang:
Reencoder design for soft-decision decoding of an (255, 239) Reed-Solomon code.
ISCAS 2006 |
| 63 | EE | Nandakishore Santhi,
Alexander Vardy:
A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs
CoRR abs/cs/0608085: (2006) |
| 62 | EE | Nandakishore Santhi,
Alexander Vardy:
Analog Codes on Graphs
CoRR abs/cs/0608086: (2006) |
| 61 | EE | Nandakishore Santhi,
Alexander Vardy:
On an Improvement over Rényi's Equivocation Bound
CoRR abs/cs/0608087: (2006) |
| 60 | EE | Navin Kashyap,
Paul H. Siegel,
Alexander Vardy:
Coding for the optical channel: the ghost-pulse constraint.
IEEE Transactions on Information Theory 52(1): 64-77 (2006) |
| 59 | EE | Moshe Schwartz,
Alexander Vardy:
On the stopping distance and the stopping redundancy of codes.
IEEE Transactions on Information Theory 52(3): 922-932 (2006) |
| 58 | EE | Ljupco Kocarev,
Frédéric Lehmann,
Gian Mario Maggio,
Bartolo Scanavino,
Zarko Tasev,
Alexander Vardy:
Nonlinear dynamics of iterative decoding systems: analysis and applications.
IEEE Transactions on Information Theory 52(4): 1366-1384 (2006) |
| 57 | EE | Tuvi Etzion,
Moshe Schwartz,
Alexander Vardy:
Optimal tristance anticodes in certain graphs.
J. Comb. Theory, Ser. A 113(2): 189-224 (2006) |
| 2005 |
|---|
| 56 | EE | Farzad Parvaresh,
Alexander Vardy:
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.
FOCS 2005: 285-294 |
| 55 | EE | Venkatesan Guruswami,
Alexander Vardy:
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.
SODA 2005: 470-478 |
| 54 | EE | Moshe Schwartz,
Alexander Vardy:
On the Stopping Distance and the Stopping Redundancy of Codes
CoRR abs/cs/0503058: (2005) |
| 53 | EE | Gérard D. Cohen,
Alexander Vardy:
Duality between Packings and Coverings of the Hamming Space
CoRR abs/cs/0507015: (2005) |
| 52 | EE | Moshe Schwartz,
Paul H. Siegel,
Alexander Vardy:
On the Asymptotic Performance of Iterative Decoders for Product Codes
CoRR abs/cs/0508085: (2005) |
| 51 | EE | Navin Kashyap,
Paul H. Siegel,
Alexander Vardy:
Coding for the Optical Channel: the Ghost-Pulse Constraint
CoRR abs/cs/0510033: (2005) |
| 50 | EE | Venkatesan Guruswami,
Alexander Vardy:
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.
IEEE Transactions on Information Theory 51(7): 2249-2256 (2005) |
| 49 | EE | Navin Kashyap,
Paul H. Siegel,
Alexander Vardy:
An Application of Ramsey Theory to Coding for the Optical Channel.
SIAM J. Discrete Math. 19(4): 921-937 (2005) |
| 2004 |
|---|
| 48 | EE | Venkatesan Guruswami,
Alexander Vardy:
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
CoRR cs.CC/0405005: (2004) |
| 47 | EE | Venkatesan Guruswami,
Alexander Vardy:
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
Electronic Colloquium on Computational Complexity (ECCC)(040): (2004) |
| 46 | | Tao Jiang,
Alexander Vardy:
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes.
IEEE Transactions on Information Theory 50(8): 1655-1664 (2004) |
| 45 | EE | Patric R. J. Östergård,
Alexander Vardy:
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces.
SIAM J. Discrete Math. 18(2): 382-387 (2004) |
| 2003 |
|---|
| 44 | | Ralf Koetter,
Alexander Vardy:
Algebraic soft-decision decoding of Reed-Solomon codes.
IEEE Transactions on Information Theory 49(11): 2809-2825 (2003) |
| 43 | | Ralf Koetter,
Alexander Vardy:
The structure of tail-biting trellises: minimality and basic principl.
IEEE Transactions on Information Theory 49(9): 2081-2105 (2003) |
| 42 | EE | Ari Trachtenberg,
Alexander Vardy:
Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist.
SIAM J. Discrete Math. 16(3): 390-392 (2003) |
| 2002 |
|---|
| 41 | | Tuvi Etzion,
Alexander Vardy:
Two-dimensional interleaving schemes with repetitions: Constructions and bounds.
IEEE Transactions on Information Theory 48(2): 428-457 (2002) |
| 40 | | Erik Agrell,
Thomas Eriksson,
Alexander Vardy,
Kenneth Zeger:
Closest point search in lattices.
IEEE Transactions on Information Theory 48(8): 2201-2214 (2002) |
| 2001 |
|---|
| 39 | | Dakshi Agrawal,
Alexander Vardy:
The turbo decoding algorithm and its phase trajectories.
IEEE Transactions on Information Theory 47(2): 699-722 (2001) |
| 38 | | Brendan J. Frey,
Ralf Koetter,
Alexander Vardy:
Signal-space characterization of iterative decoding.
IEEE Transactions on Information Theory 47(2): 766-781 (2001) |
| 37 | | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
A table of upper bounds for binary codes.
IEEE Transactions on Information Theory 47(7): 3004-3006 (2001) |
| 2000 |
|---|
| 36 | | Dakshi Agrawal,
Alexander Vardy:
Generalized minimum distance decoding in Euclidean space: Performance analysis.
IEEE Transactions on Information Theory 46(1): 60-83 (2000) |
| 35 | | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
Upper bounds for constant-weight codes.
IEEE Transactions on Information Theory 46(7): 2373-2395 (2000) |
| 1999 |
|---|
| 34 | | John D. Lafferty,
Alexander Vardy:
Ordered Binary Decision Diagrams and Minimal Trellises.
IEEE Trans. Computers 48(9): 971-987 (1999) |
| 33 | | Vahid Tarokh,
Alexander Vardy,
Kenneth Zeger:
Universal Bound on the Performance of Lattice Codes.
IEEE Transactions on Information Theory 45(2): 670-681 (1999) |
| 32 | | A. Robert Calderbank,
G. David Forney Jr.,
Alexander Vardy:
Minimal tail-biting trellises: The Golay code and more.
IEEE Transactions on Information Theory 45(5): 1435-1455 (1999) |
| 31 | | Tuvi Etzion,
Ari Trachtenberg,
Alexander Vardy:
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory 45(6): 2173-2181 (1999) |
| 30 | | Rodney G. Downey,
Michael R. Fellows,
Alexander Vardy,
Geoff Whittle:
The Parametrized Complexity of Some Fundamental Problems in Coding Theory.
SIAM J. Comput. 29(2): 545-570 (1999) |
| 1998 |
|---|
| 29 | | Mario Blaum,
Jehoshua Bruck,
Alexander Vardy:
Interleaving Schemes for Multidimensional Cluster Errors.
IEEE Transactions on Information Theory 44(2): 730-743 (1998) |
| 28 | EE | Tuvi Etzion,
Alexander Vardy:
On Perfect Codes and Tilings: Problems and Solutions.
SIAM J. Discrete Math. 11(2): 205-223 (1998) |
| 1997 |
|---|
| 27 | EE | Alexander Vardy:
Algorithmic Complexity in Coding Theory and the Minimum Distance Problem.
STOC 1997: 92-109 |
| 26 | | Daniel M. Yellin,
Alexander Vardy,
Ofer Amrani:
Joint equalization and coding for intersymbol interference channels.
IEEE Transactions on Information Theory 43(2): 409-425 (1997) |
| 25 | | Vahid Tarokh,
Alexander Vardy:
Upper bounds on trellis complexity of lattices.
IEEE Transactions on Information Theory 43(4): 1294-1300 (1997) |
| 24 | | Alexander Vardy:
The intractability of computing the minimum distance of a code.
IEEE Transactions on Information Theory 43(6): 1757-1766 (1997) |
| 1996 |
|---|
| 23 | | Alexander Vardy,
Mario Blaum,
Paul H. Siegel,
Glenn T. Sincerbox:
Conservative arrays: multidimensional modulation codes for holographic recording.
IEEE Transactions on Information Theory 42(1): 227-230 (1996) |
| 22 | | Mario Blaum,
Jehoshua Bruck,
Alexander Vardy:
MDS array codes with independent parity symbols.
IEEE Transactions on Information Theory 42(2): 529-542 (1996) |
| 21 | | A. Lafourcade,
Alexander Vardy:
Optimal sectionalization of a trellis.
IEEE Transactions on Information Theory 42(3): 689-703 (1996) |
| 20 | | Joan Feigenbaum,
G. David Forney Jr.,
Brian H. Marcus,
Robert J. McEliece,
Alexander Vardy:
Introduction to the special issue on codes and complexity.
IEEE Transactions on Information Theory 42(6): 1649-1659 (1996) |
| 19 | | G. David Forney Jr.,
Alexander Vardy:
Generalized minimum-distance decoding of Euclidean-space codes and lattices.
IEEE Transactions on Information Theory 42(6): 1992-2026 (1996) |
| 18 | | Alexander Vardy,
Frank R. Kschischang:
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis.
IEEE Transactions on Information Theory 42(6): 2027-2033 (1996) |
| 17 | EE | Gérard D. Cohen,
Simon Litsyn,
Alexander Vardy,
Gilles Zémor:
Tilings of Binary Spaces.
SIAM J. Discrete Math. 9(3): 393-412 (1996) |
| 1995 |
|---|
| 16 | | Yaron Klein,
Simon Litsyn,
Alexander Vardy:
Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.
Des. Codes Cryptography 6(3): 219-227 (1995) |
| 15 | | A. Lafourcade,
Alexander Vardy:
Asymptotically good codes have infinite trellis complexity.
IEEE Transactions on Information Theory 41(2): 555-559 (1995) |
| 14 | | Alexander Vardy:
Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice.
IEEE Transactions on Information Theory 41(5): 1495-1499 (1995) |
| 13 | | A. Lafourcade,
Alexander Vardy:
Lower bounds on trellis complexity of block codes.
IEEE Transactions on Information Theory 41(6): 1938-1954 (1995) |
| 1994 |
|---|
| 12 | | Alexander Vardy,
Yair Be'ery:
Maximum-likelihood soft decision decoding of BCH codes.
IEEE Transactions on Information Theory 40(2): 546- (1994) |
| 11 | | Tuvi Etzion,
Alexander Vardy:
Perfect binary codes: constructions, properties, and enumeration.
IEEE Transactions on Information Theory 40(3): 754-763 (1994) |
| 10 | | Ofer Amrani,
Yair Be'ery,
Alexander Vardy,
Feng-Wen Sun,
Henk C. A. van Tilborg:
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.
IEEE Transactions on Information Theory 40(4): 1030-1043 (1994) |
| 9 | | Alexander Vardy:
The Nordstrom-Robinson code: representation over $GF(4)$ and efficient decoding.
IEEE Transactions on Information Theory 40(5): 1686- (1994) |
| 8 | | Simon Litsyn,
Alexander Vardy:
The uniqueness of the Best code.
IEEE Transactions on Information Theory 40(5): 1693- (1994) |
| 7 | | Ron M. Roth,
Paul H. Siegel,
Alexander Vardy:
High-order spectral-null codes - Construction and bounds.
IEEE Transactions on Information Theory 40(6): 1826-1840 (1994) |
| 1993 |
|---|
| 6 | | Alexander Vardy,
Tuvi Etzion:
Some Constructions of Perfect Binary Codes.
AAECC 1993: 344-354 |
| 5 | | Ofer Amrani,
Yair Be'ery,
Alexander Vardy:
Bounded-Distance Decoding of the Leech Lattice and the Golay Code.
Algebraic Coding 1993: 236-248 |
| 4 | | Simon Litsyn,
Alexander Vardy:
Two new upper bounds for codes of distance 3.
Algebraic Coding 1993: 253-262 |
| 3 | | Alexander Vardy,
Yair Be'ery:
Maximum likelihood decoding of the Leech lattice.
IEEE Transactions on Information Theory 39(4): 1435- (1993) |
| 1991 |
|---|
| 2 | | Alexander Vardy,
Yair Be'ery:
On the problem of finding zero-concurring codewords.
IEEE Transactions on Information Theory 37(1): 180- (1991) |
| 1 | | Alexander Vardy,
Yair Be'ery:
More efficient soft decoding of the Golay codes.
IEEE Transactions on Information Theory 37(3): 667- (1991) |
