Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

4 relations
Alexander VardyFolded Reed–Solomon code

Broader (2)

Coding theoryError detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Computing minimal interpolation bases
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a… Expand
2016
2016
On the MDS Condition of Blaum–Bruck–Vardy Codes With Large Number Parity Columns
Binary maximum distance separable (MDS) array codes are widely used in storage systems. EVENODD code and row-diagonal parity (RDP… Expand
  • table I
  • table II
2013
2013
Iterative soft-decision decoding of Reed-Solomon convolutional concatenated codes
  • L. 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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2008
Highly Cited
2008
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the… Expand
  • figure 1
  • figure 2
2008
2008
Soft-Decision Decoding of Reed-Solomon Codes Using Successive Error-and-Erasure Decoding
We propose a soft-decision decoding algorithm of Reed-Solomon (RS) codes using successive error-and-erasure decoding. Extensive… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
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
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
2006
2006
Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
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
Reed-Solomon (RS) codes are among the most widely utilized block error-correcting codes in modern communication and computer… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 6
2004
2004
Fast factorization architecture in soft-decision Reed-Solomon decoding
Reed-Solomon (RS) codes are among the most widely utilized block error-correcting codes in modern communication and computer… Expand
2003
2003
Iterative soft-decision Reed-Solomon decoding on partial response channels
  • M. Cheng, P. Siegel
  • GLOBECOM '03. IEEE Global Telecommunications…
  • 2003
    • Corpus ID: 16379498
Since the discovery of turbo codes, iterative decoding has gained enormous momentum. The idea of repeatedly passing information… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
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