Alexander Vardy

Q: What Schools Are Affiliated With Alexander Vardy

Alexander Vardy is affiliated with the following schools: University of California, Berkeley, Technion – Israel Institute of Technology, University of California, San Diego, Tel Aviv University, Stanford University, University of Illinois Urbana-Champaign

Alexander Vardy's AcademicInfluence.com Rankings

Alexander Vardy

Engineering

#2603

World Rank

#3555

Historical Rank

Electrical Engineering

#646

World Rank

#708

Historical Rank

Applied Physics

#1699

World Rank

#1731

Historical Rank

engineering Degrees

Download Badge

Engineering

Alexander Vardy's Degrees

PhD Electrical Engineering Stanford University
Masters Electrical Engineering Stanford University
Bachelors Electrical Engineering Stanford University

Why Is Alexander Vardy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alexander Vardy was a Russian-born and Israeli-educated electrical engineer known for his expertise in coding theory. He held the Jack Keil Wolf Endowed Chair in Electrical Engineering at the University of California, San Diego. The Parvaresh–Vardy codes are named after him.

(See a Problem?)

Alexander Vardy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Closest point search in lattices (2002) (1471)
List decoding of polar codes (2011) (1423)
How to Construct Polar Codes (2011) (694)
Algebraic soft-decision decoding of Reed-Solomon codes (2000) (619)
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes (2010) (496)
The intractability of computing the minimum distance of a code (1997) (397)
Fast Polar Decoders: Algorithm and Implementation (2013) (316)
Error-Correcting Codes in Projective Space (2008) (253)
MDS array codes with independent parity symbols (1995) (239)
Hardware architectures for successive cancellation decoding of polar codes (2010) (216)
Correcting errors beyond the Guruswami-Sudan radius in polynomial time (2005) (207)
Minimal tail-biting trellises: the Golay code and more (1998) (186)
On the stopping distance and the stopping redundancy of codes (2005) (180)
Semantic Security for the Wiretap Channel (2012) (173)
Upper bounds for constant-weight codes (2000) (170)
Which codes have cycle-free Tanner graphs? (1998) (158)
List Decoding of Polar Codes (2015) (149)
Maximum-Likelihood Soft Decision Decoding of Bch Codes (1993) (136)
Fast List Decoders for Polar Codes (2015) (131)
Algorithmic complexity in coding theory and the minimum distance problem (1997) (130)
EXISTENCE OF $q$ -ANALOGS OF STEINER SYSTEMS (2013) (125)
Perfect binary codes: constructions, properties, and enumeration (1994) (111)
Codes for distributed PIR with low storage overhead (2015) (107)
A new polar coding scheme for strong security on wiretap channels (2013) (101)
Interleaving Schemes for Multidimensional Cluster Errors (1998) (98)
Bit-level soft-decision decoding of Reed-Solomon codes (1991) (96)
The Parametrized Complexity of Some Fundamental Problems in Coding Theory (1999) (90)
A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes (2003) (90)
Signal-space characterization of iterative decoding (2001) (84)
Universal Bound on the Performance of Lattice Codes (1999) (82)
On perfect codes and tilings: problems and solutions (1997) (78)
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes (2015) (77)
Minimum storage regenerating codes for all parameters (2016) (75)
Optimal sectionalization of a trellis (1996) (74)
PIR with Low Storage Overhead: Coding instead of Replication (2015) (71)
The turbo decoding algorithm and its phase trajectories (2000) (68)
Generalized minimum-distance decoding of Euclidean-space codes and lattices (1996) (68)
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions (1994) (67)
Codes for Write-Once Memories (2012) (66)
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes (2011) (66)
Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes (2004) (65)
A Cryptographic Treatment of the Wiretap Channel (2012) (64)
Lower bounds on trellis complexity of block codes (1995) (63)
More efficient soft decoding of the Golay codes (1991) (61)
Coding for racetrack memories (2017) (58)
The structure of tail-biting trellises: minimality and basic principles (2002) (57)
A nearly optimal construction of flash codes (2009) (56)
Conservative arrays: multidimensional modulation codes for holographic recording (1996) (52)
Stopping sets in codes from designs (2003) (52)
Maximum likelihood decoding of the Leech lattice (1993) (49)
Lower Bound on the Redundancy of PIR Codes (2016) (49)
On the scaling exponent of binary polarization kernels (2014) (49)
Asymptotically good codes have infinite trellis complexity (1995) (48)
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (2004) (47)
On q-analogs of Steiner systems and covering designs (2009) (47)
A table of upper bounds for binary codes (2001) (47)
The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes (2010) (46)
Multidimensional flash codes (2008) (45)
Efficient interpolation and factorization in algebraic soft-decision decoding of reed-solonion codes (2003) (45)
Constructing polar codes for non-binary alphabets and MACs (2012) (44)
Efficient two-write WOM-codes (2010) (43)
Two-dimensional interleaving schemes with repetitions: constructions and bounds (2000) (41)
Multivariate interpolation decoding beyond the Guruswami-Sudan radius (2004) (41)
Multiple Error-Correcting WOM-Codes (2010) (40)
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis (1996) (40)
Algebraic list-decoding on the operator channel (2010) (39)
On the Theory of Linear Trellises (2002) (39)
Binary Polarization Kernels From Code Decompositions (2014) (39)
Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice (1995) (39)
Nonlinear dynamics of iterative decoding systems: analysis and applications (2006) (38)
Multiple-write WOM-codes (2010) (38)
Tilings of Binary Spaces (1996) (38)
Generalized minimum distance decoding in Euclidean space: Performance analysis (1997) (37)
Multiplicity assignments for algebraic soft-decoding of reed-solomon codes (2003) (36)
Increasing the speed of polar list decoders (2014) (35)
List Decoding of Arıkan’s PAC Codes (2020) (34)
High-order spectral-null codes: constructions and bounds (1994) (33)
Generalized Sphere Packing Bound (2014) (33)
Skewness and pseudocodewords in iterative decoding (1998) (33)
Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels (2017) (33)
Explicit capacity-achieving coding scheme for the Gaussian wiretap channel (2014) (32)
Joint equalization and coding for intersymbol interference channels (1997) (32)
High-order spectral-null codes - Construction and bounds (1994) (31)
Codes, Curves, and Signals: Common Threads in Communications (1998) (31)
Nontrivial t-designs over finite fields exist for all t (2013) (30)
Minimum Storage Regenerating Codes for All Parameters (2017) (29)
The structure of tail-biting trellises: minimality and basic principl (2002) (29)
Non-binary WOM-codes for multilevel flash memories (2011) (29)
Universal Hashing for Information-Theoretic Security (2014) (27)
Constructions of batch codes with near-optimal redundancy (2016) (26)
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces (2005) (25)
On an Improvement over Rényi's Equivocation Bound (2006) (25)
Channel upgrading for semantically-secure encryption on wiretap channels (2013) (24)
On codes that correct asymmetric errors with graded magnitude distribution (2011) (24)
Polar Codes for the Deletion Channel: Weak and Strong Polarization (2019) (23)
Linearity and Complements in Projective Space (2011) (23)
On the asymptotic performance of iterative decoders for product codes (2005) (23)
The Nordstrom-Robinson code: representation over $GF(4)$ and efficient decoding (1994) (23)
Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding (2017) (22)
Polar Coding for the Binary Erasure Channel With Deletions (2017) (22)
Improved Probabilistic Bounds on Stopping Redundancy (2008) (22)
Improving turbo codes by control of transient chaos in turbo-decoding algorithms (2002) (22)
Improved schemes for asymptotically optimal repair of MDS codes (2017) (21)
Algebraic List-Decoding of Subspace Codes (2012) (21)
A Lower Bound on the Density of Sphere Packings via Graph Theory (2004) (19)
The uniqueness of the Best code (1994) (19)
Dense error-correcting codes in the Lee metric (2010) (19)
A new construction for constant weight codes (2010) (19)
A new sphere packing in 20 dimensions (1995) (18)
Codes correcting position errors in racetrack memories (2017) (18)
Analog codes on graphs (2003) (18)
Storage Coding for Wear Leveling in Flash Memories (2009) (18)
Low-Latency Factorization Architecture for Algebraic Soft-Decision Decoding of Reed–Solomon Codes (2007) (18)
Polar Coding for Deletion Channels: Theory and Implementation (2018) (18)
Divide-and-conquer interpolation for list decoding of reed-solomon codes (2004) (17)
A Complexity Reducing Transformation for the Lee-O'Sullivan Interpolation Algorithm (2007) (16)
Permuted successive cancellation decoding for polar codes (2017) (16)
Explicit Polar Codes with Small Scaling Exponent (2019) (16)
Coding for the optical channel: the ghost-pulse constraint (2005) (16)
Decoding of Reed-Solomon codes for additive cost functions (2002) (16)
On the effect of parity-check weights in iterative decoding (2004) (14)
Ordered Binary Decision Diagrams and Minimal Trellises (1999) (14)
Reencoder design for soft-decision decoding of an (255,239) Reed-Solomon code (2006) (14)
Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity (2017) (13)
Bounds on the dimension of codes and subcodes with prescribed contraction index (1990) (13)
Generalized minimum-distance decoding in Euclidean-space: performance analysis (1997) (13)
Upper bounds on trellis complexity of lattices (1997) (13)
A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes (2021) (12)
Algebraic list-decoding of Reed-Solomon product codes (2006) (12)
Factor graphs: constructions, classification, and bounds (1998) (12)
On Efficient Decoding of Polar Codes with Large Kernels (2017) (12)
Algebraic list-decoding of subspace codes with multiplicities (2011) (11)
Polar codes for channels with deletions (2017) (11)
Codes Correcting Limited-Shift Errors in Racetrack Memories (2018) (11)
New Bounds on the Capacity of Multidimensional Run-Length Constraints (2011) (11)
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects (2017) (11)
Coding for the Lee and Manhattan Metrics With Weighing Matrices (2012) (10)
Efficient fast interpolation architecture for soft-decision decoding of Reed-Solomon codes (2006) (10)
Lower bounds on the redundancy of linear codes with disjoint repair groups (2022) (10)
Explicit capacity achieving codes for defective memories (2015) (10)
Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders (2004) (10)
Unrolled Polar Decoders, Part II: Fast List Decoders (2015) (9)
Semantically-Secure Coding Scheme Achieving the Capacity of a Gaussian Wiretap Channel (2014) (8)
Binary codes with large symbols (1994) (8)
Automorphisms of Codes in the Grassmann Scheme (2012) (8)
Codes, Curves, and Signals (1998) (8)
On the missing functions of a pyramid of curves (1997) (8)
Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types (2009) (8)
New Constructions of MDS Codes with Asymptotically Optimal Repair (2018) (7)
Optimal tristance anticodes in certain graphs (2004) (7)
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes (2013) (7)
Two new bounds on the size of binary codes with a minimum distance of three (1995) (7)
Explicit constructions of finite-length WOM codes (2017) (7)
Reconstruction from Deletions in Racetrack Memories (2018) (6)
Density doubling, double-circulants, and new sphere packings (1999) (6)
Density doubling, double-circulants, and new sphere packings (1999) (6)
What's New and Exciting in Algebraic and Combinatorial Coding Theory? (2006) (6)
Introduction to the special issue on codes and complexity (1996) (6)
Probabilistic Existence of Large Sets of Designs (2017) (6)
On the parallel programming of flash memory cells (2010) (6)
Codes for Endurance-Limited Memories (2018) (5)
Classification of Certain Tail-Biting Generators for the Binary Golay Code (1998) (5)
On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes (2006) (5)
Rewriting Codes for Flash Memories (2012) (5)
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes (2020) (5)
Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist (2003) (5)
On the Number of Distinct k-Decks: Enumeration and Bounds (2019) (5)
Viterbi-Aided Successive-Cancellation Decoding of Polar Codes (2017) (5)
An Application of Ramsey Theory to Coding for the Optical Channel (2005) (5)
Locally Balanced Constraints (2020) (5)
Generalized sphere packing bound: Applications (2014) (4)
Polar Coding for Channels With Deletions (2021) (4)
Convolutional Decoding of Polar Codes (2019) (4)
Distributed storage with communication costs (2011) (4)
Factorization Architecture by Direct Root Computation for Algebraic Soft-Decision Decoding of Reed-Solomon Codes (2007) (4)
On the problem of finding zero-concurring codewords (1991) (3)
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes (2019) (3)
List Decoding of Arıkan’s PAC Codes † (2020) (3)
Optimal weight assignment for algebraic soft decoding (2001) (3)
C O ] 2 3 M ar 2 01 0 q-Analogs for Steiner Systems and Covering Designs (2010) (3)
Low-Complexity Hybrid ARQ Scheme for Polar Codes with Higher-Order Modulation (2017) (3)
Abstracts of Presentations at the International Conference on Basic and Clinical Multimodal Imaging (BaCI), a Joint Conference of the International Society for Neuroimaging in Psychiatry (ISNIP), the International Society for Functional Source Imaging (ISFSI), the International Society for Bioelectr (2013) (3)
Bit-Level Soft-Decision Decoding of (1991) (3)
Storage coding for wear leveling in flash memories (2010) (3)
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems (2006) (3)
Coding for tag collision recovery (2015) (3)
Generalized sphere packing bound: Basic principles (2014) (3)
Construction of q-analogs of Steiner systems (2013) (3)
Stopping Sets in Codes from Designs 1 (2)
Codes for RAID solutions based upon SSDs (2015) (2)
Low-Power Cooling Codes With Efficient Encoding and Decoding (2020) (2)
Duality between packings and coverings of the Hamming space (2005) (2)
Explicit and Efficient WOM Codes of Finite Length (2020) (2)
Efficient Bee Identification (2021) (2)
A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes (2019) (2)
Hardness of Successive-Cancellation Decoding of Linear Codes (2020) (2)
Low-Power Cooling Codes with Efficient Encoding and Decoding (2018) (2)
Coding for Racetrack Memories (2018) (2)
Minimum Distance of Codes and Their Branching Program Complexity (2006) (2)
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions (2020) (2)
Direct Root Computation Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes (2007) (2)
Coding for Transverse-Reads in Domain Wall Memories (2021) (2)
Bit Level Soft Decision decoding reed-solomon codes (1989) (2)
On trellis complexity of block codes: lower bounds (1995) (2)
Bounded-Distance Decoding of the Leech Lattice and the Golay Code (1993) (2)
Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications (2020) (2)
Cooling codes: Thermal-management coding for high-performance interconnects (2017) (1)
PCR, Tropical Arithmetic, and Group Testing (2022) (1)
List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding? (2021) (1)
On the Asymptotic Performance of Iterated Subcode-Decoding of Product Codes (1)
Even more efficient soft decoding of the Golay Codes (1991) (1)
Computing Permanents on a Trellis (2021) (1)
Optimal interleaving algorithms for generalized concatenated codes (2009) (1)
Perfect Tilings of Binary Spaces (1993) (1)
Sub-4.7 Scaling Exponent of Polar Codes (2022) (1)
Domination mappings into the hamming ball: Existence, constructions, and algorithms (2018) (1)
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels (2021) (1)
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications (2021) (1)
On trellis complexity of block codes: optimal sectionalizations (1995) (1)
Codes Correcting Under-and Over-Shift Errors in Racetrack Memories (2018) (1)
Constant-weight code bounds from spherical code bounds (2000) (1)
Bee Identification Problem for DNA Strands (2022) (1)
Endurance-Limited Memories with Informed Decoder (2019) (1)
Some Constructions of Perfect Binary Codes (1993) (1)
Coding-Theoretic Lower Bounds for Boolean Branching Programs (2004) (0)
q-Analogs of Steiner Systems (2012) (0)
Tropical Group Testing (2022) (0)
IEEE TRANSACTIONS ON INFORMATION THEORY H. VINCENT POOR, Editor-in-Chief ELZA ERKIP, Publications Editor ADRIAAN J. VAN WIJNGAARDEN, Publications Editor (2006) (0)
A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs (2006) (0)
Network Coding and Related Combinatorial Structures List of References (2015) (0)
Polar List Decoding for Large Polarization Kernels (2021) (0)
A Complexity Reducing Transformation for (2007) (0)
Polar Codes with Balanced Codewords (2020) (0)
Enumerating Annihilator Polynomials (2005) (0)
Combined decision feedback equalization and coding for high SNR channels (1995) (0)
FACETS OF CODING THEORY: FROM ALGORITHMS TO NETWORKS Special Issue Dedicated to the Scientific Legacy of Ralf Koetter (2011) (0)
Course Outline for CS 236610 : Recent Advances in Algebraic and Combinatorial Coding Theory (2006) (0)
Polar Codes for the Deletion Channel: Weak and Strong Polarization (2022) (0)
Improved Schemes for Asymptotically Optimal Repair of MDS Codes (2021) (0)
President's Report (2006) (0)
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes (2021) (0)
Endurance-Limited Memories: Capacity and Codes (2021) (0)
Enumerating Annihilator Polynomials over Z n (2014) (0)
The Issue of Multicenter Trials: Can One Multicenter Trial be an Alternative to the Concept of “At Least Two Pivotal Studies”? (1995) (0)
Channel Combining for Nonstationary Polarization on Erasure Channels (2021) (0)
GERHARD KRAMER, Publications Editor ADRIAAN J. VAN WIJNGAARDEN, Publications Editor (2005) (0)
A Lifting Decoding Scheme and its Application to Interleaved Linear Codes (2018) (0)
A new sphere packing in 20-dimensional Euclidean space (1995) (0)
On Trellis Complexity of lock Codes: Opdimal (1994) (0)
A Ramsey theory approach to ghostbusting (2004) (0)
Reduced Complexity Bounded-distance Decoding of the Leech Lattice (1993) (0)
Euclidean-Space: Performance Analysis (1997) (0)
Two new upper bounds for codes of distance 3 (1993) (0)
Binary Polarization Kernels From (2015) (0)
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes (2012) (0)
Anti odes for Multidimensional Interleaving S hemeswith (2011) (0)
Polar Coded Modulation via Hybrid Bit Labeling (2022) (0)
High-Order Spectral-Null Codes : Constructions (2018) (0)
Some Asymptotically-Tight Bounds on the Capacity of Multi-Dimensional RLL-Constraints (0)
Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes (2007) (0)
The Scientific Legacy of Ralf Koetter (2011) (0)
Explicit Modular Towers (2008) (0)
Efficient Algorithms for the Bee-Identification Problem (2022) (0)

This paper list is powered by the following services:

Other Resources About Alexander Vardy

en.wikipedia.org

What Schools Are Affiliated With Alexander Vardy?

Alexander Vardy is affiliated with the following schools:

Alexander Vardy's Academic­Influence.com Rankings

Alexander Vardy's Degrees

Why Is Alexander Vardy Influential?

Alexander Vardy's Published Works

Published Works

Other Resources About Alexander Vardy

What Schools Are Affiliated With Alexander Vardy?

Alexander Vardy's AcademicInfluence.com Rankings