Results 1 - 10 of 4,335

Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding

by Andrew Thangaraj, Safitha J Raj , 2008
"... Reed-Solomon (RS) codes over GF(2 m) have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding ..."
Abstract - Add to MetaCart
Reed-Solomon (RS) codes over GF(2 m) have traditionally been the most popular non-binary codes in almost all practical applications. The distance properties of RS codes result in excellent performance under hard-decision bounded-distance decoding. However, efficient and implementable soft decoding

Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes

by Venkatesan Guruswami, Madhu Sudan - IEEE TRANSACTIONS ON INFORMATION THEORY , 1999
"... Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes ..."
Abstract - Cited by 343 (42 self) - Add to MetaCart
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon

EFFICIENT VLSI ARCHITECTURE FOR SOFT-DECISION REED-SOLOMON DECODING

by Xinmiao Zhang, Jiangli Zhu
"... Reed-Solomon (RS) codes can be found in many digital communication and storage systems. Recently, significant advancements have been made on algebraic soft-decision decoding (ASD) of RS codes. Among the ASD algorithms with practical multiplicity assignment schemes, the bit-level generalized minimum ..."
Abstract - Cited by 9 (4 self) - Add to MetaCart
Reed-Solomon (RS) codes can be found in many digital communication and storage systems. Recently, significant advancements have been made on algebraic soft-decision decoding (ASD) of RS codes. Among the ASD algorithms with practical multiplicity assignment schemes, the bit-level generalized minimum

VLSI Architectures for Soft-decision decoding of Reed-Solomon Codes

by Arshad Ahmed, Ralf Koetter, Naresh R. Shanbhag , 2003
"... Soft-decision decoding of Reed-Solomon codes delivers significant coding gains over classical minimum distance decoding. In this paper, we present architectures for polynomial interpolation and factorization, the two main steps of the soft-decoding algorithm. We introduce an algorithmic transformati ..."
Abstract - Cited by 18 (5 self) - Add to MetaCart
Soft-decision decoding of Reed-Solomon codes delivers significant coding gains over classical minimum distance decoding. In this paper, we present architectures for polynomial interpolation and factorization, the two main steps of the soft-decoding algorithm. We introduce an algorithmic

Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information

by Jing Jiang, Krishna R. Narayanan , 2008
"... The performance of algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies of algebraic soft-decision decoding with infinite cost are first studied over erasure channels and the binary symmetric channel. The ..."
Abstract - Cited by 10 (2 self) - Add to MetaCart
decoding compares favorably with many other Reed-Solomon soft-decision decoding algorithms over various channels. Moreover, owing to the simplicity of the proposed bit-level generalized minimum distance decoding, its performance can be tightly bounded using order statistics.

Performance analysis of algebraic soft-decision decoding of reed-solomon codes

by Andrew Duggan, Er Barg - in Proc. Allerton , 2006
"... Abstract — We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the softdecision decoder produces a list that contains the transmitt ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract — We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the softdecision decoder produces a list that contains

Hardware Complexities of Algebraic Soft-decision Reed-Solomon Decoders and Comparisons

by Xinmiao Zhang, Jiangli Zhu
"... Abstract—Algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes can achieve significant coding gain over hard-decision decoding. For practical implementation purpose, ASD algorithms with simple multiplicity assignment schemes are preferred. This paper answers the question of which practic ..."
Abstract - Add to MetaCart
Abstract—Algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes can achieve significant coding gain over hard-decision decoding. For practical implementation purpose, ASD algorithms with simple multiplicity assignment schemes are preferred. This paper answers the question of which

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE Trans. Inform. Theory , 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract - Cited by 600 (43 self) - Add to MetaCart
Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms

SOFT-DECISION DECODING OF REED-SOLOMON CODES USING PATTERN INFORMATION OVER PARTIAL RESPONSE CHANNELS

by Soowoong Lee, Soowoong Lee , 2009
"... by ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract not found

Improved Decoding of Reed-Solomon andAlgebraic-Geometry Codes

by unknown authors , 1999
"... Abstract Given an error-correcting code over strings of length n and an arbitrary input string also oflength n, the list decoding problem is that of finding all codewords within a specified Hammingdistance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomo ..."
Abstract - Add to MetaCart
to a weighted curve fitting problem, which may be of use in soft-decision decoding algorithms for Reed-Solomon codes. Keywords: Error-correcting codes, Reed-Solomon codes, Algebraic-Geometry codes, Decodingalgorithms, List decoding, Polynomial time algorithms.
Results 1 - 10 of 4,335