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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

The Koetter-Vardy (KV) algorithm achieves advanced decoding performance for Reed-Solomon (RS) codes but with a high computational…

2018

Binary maximum distance separable (MDS) array codes play an important role in storage systems. The EVENODD code is a typical…

2016

This paper proposes a low-complexity high performance soft-in hard-out decoding algorithm for Reed-Solomon (RS) codes. The…

2016

Algebraic-geometric (AG) codes have long been considered as a possible candidate to replace Reed-Solomon (RS) codes. However…

2014

Traditionally, Reed-Solomon (RS) codes have been employed in magnetic data storage devices due to their effectiveness in…

2014

A novel soft-decision decoding algorithm for Reed-Solomon codes over F2m is considered. The proposed approach is based on their…

2013

Reed-Solomon convolutional concatenated (RSCC) code is a popular coding scheme whose application can be found in wireless and…

2012

This paper proposes an iterative soft-decision decoding algorithm for one of the most popular algebraic-geometric (AG) codes…

2011

This paper addresses three problems concerning the list decoding algorithm for Mahdavifar--Vardy (MV) codes. First, the condition…

2008

This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in…