Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,234,640 papers from all fields of science
Search
Sign In
Create Free Account
Parvaresh–Vardy code
Known as:
Parvaresh-Vardy code
Parvaresh–Vardy codes are a family of error-correcting codes first described in 2005 by Farzad Parvaresh and Alexander Vardy. They can be used for…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
4 relations
Alexander Vardy
Folded Reed–Solomon code
Broader (2)
Coding theory
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Computing minimal interpolation bases
C. Jeannerod
,
Vincent Neiger
,
É. Schost
,
G. Villard
J. Symb. Comput.
2017
Corpus ID: 10573019
2017
2017
Row reduction applied to decoding of rank-metric and subspace codes
S. Puchinger
,
J. R. N. Nielsen
,
Wenhui Li
,
V. Sidorenko
Des. Codes Cryptogr.
2017
Corpus ID: 11526676
We show that decoding of $$\ell $$ℓ-Interleaved Gabidulin codes, as well as list-$$\ell $$ℓ decoding of Mahdavifar–Vardy (MV…
Expand
2013
2013
Iterative soft-decision decoding of Reed-Solomon convolutional concatenated codes
Li Chen
,
Xiao Ma
IEEE International Symposium on Information…
2013
Corpus ID: 1875472
Reed-Solomon convolutional concatenated (RSCC) code has been widely applied in wireless and space communications. However…
Expand
2011
2011
On List Decoding of Mahdavifar-Vardy Codes
Hongmei Xie
,
Zhiyuan Yan
,
B. Suter
International Symposium on Networking Coding
2011
Corpus ID: 17846969
This paper addresses three problems concerning the list decoding algorithm for Mahdavifar--Vardy (MV) codes. First, the condition…
Expand
Highly Cited
2008
Highly Cited
2008
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Enkatesan G Uruswami
2008
Corpus ID: 20233192
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the…
Expand
2008
2008
Soft-Decision Decoding of Reed-Solomon Codes Using Successive Error-and-Erasure Decoding
Soo-Woong Lee
,
B. Kumar
IEEE GLOBECOM - IEEE Global Telecommunications…
2008
Corpus ID: 454214
We propose a soft-decision decoding algorithm of Reed-Solomon (RS) codes using successive error-and-erasure decoding. Extensive…
Expand
2008
2008
Non-binary LDPC codes vs. Reed-Solomon codes
Bo Zhou
,
Li Zhang
,
+4 authors
M. Xu
Information Theory and Applications Workshop
2008
Corpus ID: 13891335
This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in…
Expand
2007
2007
Further Exploring the Strength of Prediction in the Factorization of Soft-Decision Reed–Solomon Decoding
Xinmiao Zhang
IEEE Transactions on Very Large Scale Integration…
2007
Corpus ID: 24357711
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in digital communication and storage systems…
Expand
Highly Cited
2006
Highly Cited
2006
Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
W. Gross
,
F. Kschischang
,
R. Koetter
,
P. G. Gulak
2006
Corpus ID: 20743766
Efficient soft-decision decoding of Reed–Solomon codes is made possible by the Koetter–Vardy (KV) algorithm which consists of a…
Expand
2004
2004
Fast factorization architecture in soft-decision Reed-Solomon decoding
Xinmiao Zhang
,
K. Parhi
2004
Corpus ID: 56922281
Reed-Solomon (RS) codes are among the most widely utilized block error-correcting codes in modern communication and computer…
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