✦ LIBER ✦

A note on the construction of optimal linear codes

✍ Scribed by Fumikazu Tamari

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 898 KB
Volume: 5
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(81)90042-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Notes on a construction of error correct

Notes on a construction of error correcting codes

✍ Toru Hada; Masao Kasahara 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 900 KB

A note on the construction of asymptotic

A note on the construction of asymptotically linear estimators

✍ Anton Schick 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 803 KB

Construction of Some Optimal Ternary Lin

Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound

✍ N. Hamada; Helleseth T. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Correction to “a note on the constructio

Correction to “a note on the construction of asymptotically linear estimators”

✍ Anton Schick 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 82 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.

On the reconstruction of linear codes

✍ Philip Maynard; Johannes Siemons 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 2 views

For a linear code over GF (q) we consider two kinds of ''subcodes'' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstructi