✦ LIBER ✦

Consecutive Weierstrass gaps and minimum distance of Goppa codes

✍ Scribed by Arnaldo Garcia; Seon Jeong Kim; Robert F. Lax

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 515 KB
Volume: 84
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(93)90039-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

An algorithm for the computation of the

An algorithm for the computation of the minimum distance of LDPC codes

✍ Daneshgaran, Fred ;Laddomada, Massimiliano ;Mondin, Marina 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 2 views

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\)

Estimating the minimum distance of large

Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods

✍ Crozier, Stewart ;Guinand, Paul ;Hunt, Andrew 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

## Abstract A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compare

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