MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Alexander Vardy" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 23 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Full-rank Tilings of ... Do Not Exist  
  • by Ari Trachtenberg, Alexander Vardy — 2003
  • …We show that there are no full-rank tilings of F 2 , using a carefully designed exhaustive search. This solves an open problem posed in [5] and implies that a full-rank perfect binary code of length 15 with a kernel of dimension 7 does not exist.…
  • Add To MetaCart
  • Decoding of Reed Solomon Codes for Additive Cost Functions  
  • by Ralf Koetter, Alexander Vardy — 2002 — in Proc. ISIT
  • …this paper we investigate the case of arbitrary additive cost functions de ned on the product space Fq Y . Such a cost function includes both Hamming and generalized Hamming metric as well as log-likelihood based costs as special cases…
  • Cited by 4 (1 self) – Add To MetaCart
  • On the Theory of Linear Trellises  
  • by Ralf Koetter, Alexander Vardy — 2002 — in Information, Coding and Mathematics
  • …Trellis linearity, first considered by McEliece in 1996, turns out to be crucial in the study of tail-biting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous definition of linearity is given for both conventional and tail-biting trellises.…
  • Cited by 9 (1 self) – Add To MetaCart
  • Soft decoding of Reed Solomon codes and optimal weight assignments  
  • by Ralf Koetter, Alexander Vardy — 2002
  • … A polynomial-time decoding algorithm for Reed-Solomon codes is developed in the context of interpolation based decoding algorithms. The developed algorithm maximizes the error correction capability of the code for a given additive cost function. A tight bound is given on the maximum additive error …
  • Cited by 2 (0 self) – Add To MetaCart
  • Lexicographic Codes: Constructions Bounds, and Trellis Complexity  
  • by Ari Trachtenberg, Alexander Vardy — 1997 — in Proc. 31st Annual Conference on Information Sciences and Systems
  • …We study lexicographic codes, which are generated by an iterative greedy construction. We analyze the relationship between successive iterations in this construction, and derive bounds on the parameters of the resulting codes that are tighter than the presently known bounds. Furthermore, we generali…
  • Cited by 1 (0 self) – Add To MetaCart
  • Ordered Binary Decision Diagrams and Minimal Trellises  
  • by John Lafferty, Alexander Vardy — 1999 — IEEE Transactions on Computers
  • …Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal verification of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a p…
  • Cited by 2 (1 self) – Add To MetaCart
  • Maximum-likelihood decoding of Reed-Solomon codes is NP-hard  
  • by Venkatesan Guruswami, Alexander Vardy — 2005 — IEEE Transactions on Information Theory
  • …Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear codes is NP-hard. Nevertheless, it was so far unknown whether maximum-likelihood decoding remains hard for any specific fami…
  • Cited by 16 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB