Forney algorithm

E807787

The Forney algorithm is a key error-location and error-value computation method used in decoding Reed–Solomon and other BCH error-correcting codes in digital communication systems.

Try in SPARQL Jump to: Statements Referenced by

Statements (47)

Predicate Object
instanceOf algorithm
coding theory concept
error-correction decoding algorithm
appliesTo cyclic codes
linear block codes
maximum distance separable codes
assumes error evaluator polynomial already known
error locator polynomial already known
basedOn error evaluator polynomial
error locator polynomial
finite field arithmetic
polynomial evaluation
computes error magnitude at each error location
domain Galois field GF(2^m) NERFINISHED
Galois field GF(q) NERFINISHED
field coding theory
digital communications
information theory
goal recover original codeword from corrupted received word
input error evaluator polynomial
error locator polynomial
syndromes
namedAfter G. David Forney Jr. NERFINISHED
output error locations
error magnitudes
property computes error values without solving linear systems directly
operates over Galois fields
reduces decoding complexity
used in algebraic decoding
relatedTo BCH code NERFINISHED
Berlekamp–Massey algorithm NERFINISHED
Euclidean algorithm decoder
Reed–Solomon code NERFINISHED
syndrome decoding
stepOf algebraic decoding process
error-correction procedure
usedFor decoding BCH codes
decoding Reed–Solomon codes
error-location computation
error-value computation
syndrome-based decoding
usedIn BCH decoders
Reed–Solomon decoders NERFINISHED
block code decoders
data transmission over noisy channels
digital communication systems
digital storage systems

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Forney notableWork Forney algorithm
subject surface form: David A. Forney