Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Alexander Vardy
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been… Expand
2018
2018
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
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
Nearest-neighbor inference methods have been widely and successfully used in numerous applications such as forecasting which news… Expand
2013
2013
An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded… Expand
2013
2013
UNIVERSITY OF CALIFORNIA, SAN DIEGO Hypergraph Independence Numbers A dissertation submitted in partial satisfaction of the… Expand
Highly Cited
2011
Highly Cited
2011
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 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 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
A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. This list-decoding algorithm is algebraic… Expand
