Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,464,193 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
(opens in a new tab)
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.
2015
2015
Algebraic Construction of Tail-Biting Trellises for Linear Block Codes
M. Tajima
arXiv.org
2015
Corpus ID: 13278236
In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space…
Expand
2008
2008
Non-binary LDPC codes vs. Reed-Solomon codes
Bo Zhou
,
Li Zhang
,
+4 authors
Meina 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
2006
2006
The UK Office of Fair Trading clears a merger in the retail market for new and used cars, subject to the divestment of four car dealerships (Pendragon/Reg Vardy)
Matthew Gaved
2006
Corpus ID: 169073278
The operation Pendragon plc (“Pendragon”) is active in the UK in the retail sale, contract hire and leasing of new and used…
Expand
2004
2004
Adaptive and iterative soft-decision list decoding
Feng Cai
,
M. A. Armand
,
M. Motani
International Symposium onInformation Theory…
2004
Corpus ID: 9400501
An efficient adaptive list decoder for Reed-Solomon (RS) codes by adaptively adjusting the list size is presented. Simulations…
Expand