✦ LIBER ✦

Reduced GMD decoding

✍ Scribed by Weber, J.H.; Abdel-Ghaffar, K.A.S.

Book ID: 114637098
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 818 KB
Volume: 49
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2003.809504

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chase-type and GMD coset decodings

✍ Fossorier, M.P.C.; Shu Lin 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 147 KB

Asymptotic optimality of the GMD and Cha

Asymptotic optimality of the GMD and Chase decoding algorithms

✍ Yuansheng Tang; Fujiwara, T.; Kasami, T. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 314 KB

Geometrical and performance analysis of

Geometrical and performance analysis of GMD and Chase decoding algorithms

✍ Fishler, E.; Amrani, O.; Be'ery, Y. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 333 KB

A multicast hybrid ARQ scheme using MDS

A multicast hybrid ARQ scheme using MDS codes and GMD decoding

✍ Sakakibara, K.; Kasahara, M. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 780 KB

Constrained shift-register synthesis: Fa

Constrained shift-register synthesis: Fast GMD decoding of 1D algebraic codes

✍ Yutaka Kobayashi; Masaya Fujisawa; Shojiro Sakata 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

Generalized minimum-distance decoding (GMD) is realized by iterating simultaneous erasure-error correction while varying the erasure pattern. Simultaneous erasureerror correction can be considered as a constrained (in regard to the erasure location ideal) shift-register synthesis problem. Then, vari

GMD

📂 Article 📅 1983 🏛 Elsevier Science ⚖ 300 KB