✦ LIBER ✦

Fast decoding of codes from algebraic curves

✍ Scribed by Dahl, C.

Book ID: 114539900
Publisher: IEEE
Year: 1994
Tongue: English
Weight: 663 KB
Volume: 40
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.272487

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast decoding of codes from algebraic pl

Fast decoding of codes from algebraic plane curves

✍ Justesen, J.; Larsen, K.J.; Jensen, H.E.; Hoholdt, T. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 748 KB

Constructing codes from algebraic curves

✍ Ozbudak, F.; Stichtenoth, H. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 154 KB

Fast-Decodable Asymmetric Space-Time Cod

Fast-Decodable Asymmetric Space-Time Codes From Division Algebras

✍ Vehkalahti, R.; Hollanti, C.; Oggier, F. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 470 KB

Some new codes from algebraic curves

✍ Cunsheng Ding; Niederreiter, H.; Chaoping Xing 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 189 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

List decoding of algebraic-geometric cod

List decoding of algebraic-geometric codes

✍ Shokrollahi, M.A.; Wasserman, H. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 310 KB