Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
Alexander Vardy
Alexander Vardy is a Russian-born and Israeli-educated electrical engineer known for his expertise in coding theory. He holds the Jack Keil Wolf…
Expand
Wikipedia
Create Alert
Related topics
Related topics
7 relations
Coding theory
IEEE Information Theory Society
IEEE Transactions on Information Theory
Lee distance
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Probabilistic Existence of Large Sets of Designs
Shachar Lovett
,
Sankeerth Rao
,
A. Vardy
SODA
2018
Corpus ID: 32417106
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been…
Expand
2018
2018
A New Approach for Examining q-Steiner Systems
T. Etzion
Electron. J. Comb.
2018
Corpus ID: 13884443
One of the most intriguing problems in $q$-analogs of designs and codes is the existence question of an infinite family of $q…
Expand
2017
2017
Explicit constructions of finite-length WOM codes
Y. M. Chee
,
H. Kiah
,
A. Vardy
,
Eitan Yaakobi
IEEE International Symposium on Information…
2017
Corpus ID: 11471523
Write-once memory (WOM) is a storage device consisting of binary cells which can only increase their levels. A t-write WOM code…
Expand
2015
2015
Latent source models for nonparametric inference
George H. Chen
2015
Corpus ID: 31983046
Nearest-neighbor inference methods have been widely and successfully used in numerous applications such as forecasting which news…
Expand
2013
2013
Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction
A. Ghayoori
,
T. A. Gulliver
ArXiv
2013
Corpus ID: 14922262
An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded…
Expand
2013
2013
Hypergraph Independence Numbers
Alexander Eustis
2013
Corpus ID: 59906792
UNIVERSITY OF CALIFORNIA, SAN DIEGO Hypergraph Independence Numbers A dissertation submitted in partial satisfaction of the…
Expand
Highly Cited
2011
Highly Cited
2011
Codes for Symbol-Pair Read Channels
Yuval Cassuto
,
M. Blaum
IEEE Transactions on Information Theory
2011
Corpus ID: 9654458
A new coding framework is established for channels whose outputs are overlapping pairs of symbols. Such channels are motivated by…
Expand
Highly Cited
2005
Highly Cited
2005
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
M. Sudan
IEEE Transactions on Information Theory
2005
Corpus ID: 1839997
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that…
Expand
2005
2005
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
V. Guruswami
,
A. Vardy
SODA
2005
Corpus ID: 6667677
Maximum-likelihood decoding is one of the central problems in coding theory. It has been known for over 25 years that maximum…
Expand
Highly Cited
2003
Highly Cited
2003
Algebraic soft-decision decoding of Reed-Solomon codes
R. Koetter
,
A. Vardy
IEEE Trans. Inf. Theory
2003
Corpus ID: 15500640
A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. This list-decoding algorithm is algebraic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE