Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,360,350 papers from all fields of science
Search
Sign In
Create Free Account
Generalized minimum-distance decoding
Known as:
General minimum distance decoding
, Generalized minimum distance decoding
In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Algorithm
Berlekamp–Welch algorithm
Code
Coding theory
Expand
Broader (2)
Error detection and correction
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The Euclidean algorithm for Generalized Minimum Distance decoding of Reed-Solomon codes
Sabine Kampf
,
M. Bossert
IEEE Information Theory Workshop
2010
Corpus ID: 14756898
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean…
Expand
2007
2007
Lattice Codes and Generalized Minimum-Distance Decoding for OFDM Systems
A. Clark
,
Desmond P. Taylor
IEEE Transactions on Communications
2007
Corpus ID: 41514926
Lattice coding of orthogonal frequency-division multiplexing (OFDM) systems is considered. Mapping of multilevel construction…
Expand
2006
2006
An Architectural Comparison of Reed-Solomon Soft-Decoding Algorithms
Arshad Ahmed
,
Naresh R Shanbhag
,
R. Koetter
Fortieth Asilomar Conference on Signals, Systems…
2006
Corpus ID: 27041417
Reed-Solomon codes are used as error-correcting codes in diverse communication system applications. The decoding performance of…
Expand
2000
2000
Limited-trial generalized minimum distance decoding with fixed erasing
J. Weber
,
K. Abdel-Ghaffar
IEEE International Symposium on Information…
2000
Corpus ID: 123118316
A framework is presented for generalized minimum distance (GMD) decoding with a limited number of decoding trials and fixed…
Expand
2000
2000
The implementation of generalized minimum distance decoding for Reed Solomon codes
A. Mahmudi
,
M. Benaissa
,
P. Sweeney
IEEE International Symposium on Circuits and…
2000
Corpus ID: 36727609
Generalized minimum distance (GMD) decoding is a variant of soft-decision decoding for RS codes. It is well known that soft…
Expand
1994
1994
Application of generalized minimum distance decoding to hybrid-ARQ error control
M. Rice
IEEE Transactions on Communications
1994
Corpus ID: 35818156
Generalized minimum distance (GMD) decoding is modified to allow simultaneous error detection and error correction. The soft…
Expand
1991
1991
An Improvement to Generalized-Minimum-Distance Decoding
Steven Silvio Pietrobon
,
R. Deng
,
A. Lafanechére
,
G. Ungerboeck
1991
Corpus ID: 124422749
1987
1987
On Generalized Minimum Distance Decoding
A. Dür
International Symposium on Applied Algebra…
1987
Corpus ID: 40025498
A numerical method to compute the performance probabilities of GMD decoders is proposed for binary antipodal signaling on the…
Expand
1982
1982
Generalized minimum distance decoding on majority logic decodable codes
T. Hwang
,
Steven Guan
IEEE Transactions on Information Theory
1982
Corpus ID: 43698734
Generalized minimum distance decoding schemes are found for majority logic decodable codes. These decoding schemes are parallel…
Expand
1980
1980
Generalized minimum distance decoding algorithms for Q ary output channels (Corresp.)
C. Yu
,
D. Costello
IEEE Transactions on Information Theory
1980
Corpus ID: 11328300
A new condition for a generalized minimum distance decoder to guarantee correct decoding is developed. Based on this condition…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE