𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Explicit construction of optimal constant-weight codes for identification via channels

✍ Scribed by Verdu, S.; Wei, V.K.

Book ID
114539649
Publisher
IEEE
Year
1993
Tongue
English
Weight
636 KB
Volume
39
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructive techniques for labeling con
Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
✍ Inessa Levi; Steve Seif πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 283 KB

The Partition Type Conjecture, a generalization of the Middle Levels Conjecture of combinatorics, states that for all positive integers n and r, with n > r > 1, and every non-exceptional partition type Ο„ of weight r of X n , there exists a constant weight Gray code which admits an orthogonal labelin

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