✦ LIBER ✦

Goppa-like bounds for the generalized Feng-Rao distances

✍ Scribed by J.I. Farrán; C. Munuera

Book ID: 104444204
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 608 KB
Volume: 6
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00183-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acute semigroups, the order bound on the

Acute semigroups, the order bound on the minimum distance, and the Feng-Rao improvements

✍ Bras-Amoros, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 342 KB

A new lower bound for the minimum distan

A new lower bound for the minimum distance of binary Goppa codes

✍ Feng Guiliang 📂 Article 📅 1985 🏛 SP Science Press 🌐 English ⚖ 278 KB

On the generalized Cramer-Rao bound for

On the generalized Cramer-Rao bound for the estimation of the location

✍ Batalama, S.N.; Kazakos, D. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 256 KB

The optimality of Feng–Rao designed mini

The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order

✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet

A bounded-distance decoding algorithm fo

A bounded-distance decoding algorithm for the Leech lattice, with generalizations

✍ Forney, G.D., Jr. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 533 KB

A bound for the Euclidean distance betwe

A bound for the Euclidean distance between restricted and unrestricted estimators of parametric functions in the general linear model

✍ Pawel R. Pordzik 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 136 KB