✦ LIBER ✦

Subclass of binary Goppa codes with minimal distance equal to the design distance

✍ Scribed by Bezzateev, S.V.; Shekhunova, N.A.

Book ID: 114540169
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 461 KB
Volume: 41
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.370170

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chain of Separable Binary Goppa Codes an

Chain of Separable Binary Goppa Codes and Their Minimal Distance

✍ Bezzateev, S.; Shekhunova, N. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 265 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 Minimal Distance of Binary Self-D

On the Minimal Distance of Binary Self-Dual Cyclic Codes

✍ Heijne, B.; Top, J. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 144 KB

A Subclass of Binary Goppa Codes With Im

A Subclass of Binary Goppa Codes With Improved Estimation of the Code Dimension

✍ Sergei V. Bezzateev; Natalia A. Shekhunova 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 113 KB

Design of efficient balanced codes with

Design of efficient balanced codes with minimum distance 4

✍ Laih, C.-S.; Yang, C.-N. 📂 Article 📅 1996 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 491 KB

On the maximum cardinality of binary con

On the maximum cardinality of binary constant weight codes with prescribed distance

✍ Cornelis de Vroedt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB

De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance, Discrete Mathematics 97 (1991) 155-160. Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 G w < [n/2]) and Hamming distance d. In this paper a method is di