✦ LIBER ✦

Rigid linear binary codes

✍ Scribed by Hanno Lefmann; Kevin T Phelps; Vojtěch Rödl

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 669 KB
Volume: 63
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(93)90028-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Varieties of binary linear codes

✍ R. Quackenbush 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 84 KB

Linear binary codes with intersection pr

Linear binary codes with intersection properties

✍ D. Miklós 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Polynomial invariants for binary linear

Polynomial invariants for binary linear codes

✍ Johannes Maks; Juriaan Simonis 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 494 KB

On the metrical rigidity of binary codes

✍ S.V. Avgustinovich; F.I. Solov'eva 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 449 KB

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.

Generative binary codes

✍ M. Haft; R. Hofman; V. Tresp 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 551 KB