Generalized minimum distance decoding

Authors:
G. Forney, Jr.
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

Hardness amplification within NP against deterministic algorithms

Journal of Computer and System Sciences
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes

Finite Fields and Their Applications
A joint channel-network coding based on product codes for the multiple-access relay channel

ISRN Communications and Networking
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff

Problems of Information Transmission
Boolean functions over nano-fabrics: improving resilience through coding

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	754.84

Visualization

Abstract

We introduce a new distance measure which permits likelihood information to be used in algebraic minimum distance decoding techniques. We give an efficient decoding algorithm, and develop exponential bounds on the probability of not decoding correctly. In one application, this technique yields the same probability of error as maximum likelihood decoding.