✦ LIBER ✦

Minimum Distance Decoding of General Algebraic Geometry Codes via Lists

✍ Scribed by Drake, N.; Matthews, G.L.

Book ID: 111916971
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 168 KB
Volume: 56
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2010.2054670

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized minimum distance iterative d

Generalized minimum distance iterative decoding of Tanner codes

✍ Saejoon Kim 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 149 KB

Bounding minimum distances of cyclic cod

Bounding minimum distances of cyclic codes using algebraic geometry

✍ Nigel Boston 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Efficient Generalized Minimum-distance D

Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

✍ Jiangli Zhu; Xinmiao Zhang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 384 KB

Gröbner basis approach to list decoding

Gröbner basis approach to list decoding of algebraic geometry codes

✍ Henry O’Keeffe; Patrick Fitzpatrick 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 244 KB

Generation of matrices for determining m

Generation of matrices for determining minimum distance and decoding of cyclic codes

✍ Shen, K.K.; Wang, C.; Tzeng, K.K.; Shen, B.-Z. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 490 KB

On Multisequence Shift Register Synthesi

On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes

✍ N. Kamiya 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

In this paper. it is shown that the problem of generalized-minimum-distance (GMD) decoding of Reed-Solomon (RS) codes can be reduced to the problem of multisequence shift register synthesis, and a simple algorithm is presented that yields a solution for this problem by finding, for \(k=1,2, \ldots\)