The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexander Vardy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  66. Duality between Packings and Coverings of the Hamming Space [Citation Graph (, )][DBLP]


  67. On the Asymptotic Performance of Iterative Decoders for Product Codes [Citation Graph (, )][DBLP]


  68. Coding for the Optical Channel: the Ghost-Pulse Constraint [Citation Graph (, )][DBLP]


  69. Multidimensional Flash Codes [Citation Graph (, )][DBLP]


  70. A Nearly Optimal Construction of Flash Codes [Citation Graph (, )][DBLP]


  71. Storage Coding for Wear Leveling in Flash Memories [Citation Graph (, )][DBLP]


  72. Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes [Citation Graph (, )][DBLP]


  73. Dense Error-Correcting Codes in the Lee Metric [Citation Graph (, )][DBLP]


  74. A New Construction for Constant Weight Codes [Citation Graph (, )][DBLP]


  75. The Re-Encoding Transformation in Algebraic List-Decoding of Reed-Solomon Codes [Citation Graph (, )][DBLP]


  76. Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes [Citation Graph (, )][DBLP]


Search in 0.255secs, Finished in 0.257secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002