Live briefing
Everything about Generalized minimum-distance decoding
Coding theory algorithm
In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using an errors-and-erasures decoder for the outer code. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Generalized minimum-distance decodingA 5-minute orientation
- Pick up a classic book: Neural Information ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Generalized minimum distance decodingCited 441 times
- Go sideways: Binary symmetric channelA closely related topic
- Go sideways: List decodingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Generalized minimum distance decoding
An improvement to generalized-minimum-distance decoding
Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
Generalized minimum-distance decoding of Euclidean-space codes and lattices
Generalized minimum distance decoding in Euclidean space: performance analysis
Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes
Generation of matrices for determining minimum distance and decoding of cyclic codes
📚 Books worth reading
Neural Information ProcessingTingwen Huang · 2012
Coding theory, cryptography, and related areasInternational Conference on Coding Theory, Cryptography, and Related Areas (1998 Guanajuato, Mexico) · 2000
Coding the MatrixPhilip N. Klein · 2013
Introduction to artificial neural systemsJacek M. Zurada · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Binary symmetric channel A binary symmetric channel (or BSCp) is a common communications channel model used in coding theory and information theory. In this model, a transmitter…
- List decoding In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. The notion was proposed by Elias…
- Canonical singularity In mathematics, canonical singularities are a class of singularities that appear on the canonical model of an algebraic variety, and terminal singularities…
- Monte Carlo integration In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically…
- Anatoly Karatsuba Anatoly Alexeyevich Karatsuba (his first name often spelled Anatolii) (Russian: Анато́лий Алексе́евич Карацу́ба; Grozny, Soviet Union, 31 January 1937…
- Period mapping In mathematics, in the field of algebraic geometry, the period mapping relates families of Kähler manifolds to families of Hodge structures. Let f : X…
- Drift plus penalty In the mathematical theory of probability, the drift-plus-penalty method is used for optimization of queueing networks and other stochastic systems. The…
- Magnetic resonance (quantum mechanics) In quantum mechanics, magnetic resonance is a resonant effect that can appear when a magnetic dipole is exposed to a static magnetic field and perturbed…