✦ LIBER ✦

On the metrical rigidity of binary codes

✍ Scribed by S.V. Avgustinovich; F.I. Solov'eva

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 449 KB
Volume: 6
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00196-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the covering radius of long binary BC

On the covering radius of long binary BCH codes

✍ A Tietäinen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A note on binary grammatical codes of tr

A note on binary grammatical codes of trees

✍ Andrzej Ehrenfeucht; Paulien ten Pas; Grzegorz Rozenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 916 KB

A note on binary cyclic codes of blockle

A note on binary cyclic codes of blocklength 63

✍ Richard E. Blahut 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 508 KB

A method of investigating the minimum distance of binary cyclic codes of composite blocklength is described; only the case of blocklength 63 is discussed in any detail. Moreover, the usefulness of the method is left as an unanswered question. 'Your proof of Theorem 5.9.2 is the same as the one in M

The Asymptotic Number of Inequivalent Bi

The Asymptotic Number of Inequivalent Binary Codes and Nonisomorphic Binary Matroids

✍ Marcel Wild 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The asymptotic value as nPR of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids.

Explicit definition of the binary reflec

Explicit definition of the binary reflected Gray codes

✍ Marston Conder 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB

It is shown that for 1 <~j<~n and 1 ~<k ~<2", the jth letter of the kth word of the binary reflected Gray code of length n is equal to the parity of the binomial coefficient 2"-2" ~ iC[2, 2,-~-~-~/21 modulo 2. Also it is shown how this observation and the usual iterative definition of the binary ref

The construction of periodically time-va

The construction of periodically time-variant convolutional codes using binary linear block codes

✍ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 483 KB

## Abstract In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.