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
Row reduction applied to decoding of rank-metric and subspace codes
We show that decoding of $$\ell $$ℓ-Interleaved Gabidulin codes, as well as list-$$\ell $$ℓ decoding of Mahdavifar–Vardy (MV… Expand
  • figure 1
Is this relevant?
2016
2016
Algebraic chase decoding of Reed-Solomon codes using module minimisation
This paper proposes a low-complexity high performance soft-in hard-out decoding algorithm for Reed-Solomon (RS) codes. The… Expand
  • figure 1
  • figure 2
Is this relevant?
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Iterative Soft Decoding of Reed-Solomon Convolutional Concatenated Codes
  • Li Chen
  • IEEE Transactions on Communications
  • 2013
    • Corpus ID: 21727981
Reed-Solomon convolutional concatenated (RSCC) code is a popular coding scheme whose application can be found in wireless and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
2008
2008
Non-binary LDPC codes vs. Reed-Solomon codes
This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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
Is this relevant?
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
Is this relevant?
2005
2005
Reducing the alphabet size of the Parvaresh-Vardy code using Algebraic Geometry codes
The invention describes new high temperature structural materials consisting of titanium carbide vanadium carbide alloys produced… Expand
Is this relevant?
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
Is this relevant?
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