✦ LIBER ✦

A coding of the countable linear orderings

✍ Scribed by Patrick Dehornoy

Publisher: Springer Netherlands
Year: 1990
Tongue: English
Weight: 362 KB
Volume: 49
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf00370167

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The metamathematics of scattered linear

The metamathematics of scattered linear orderings

✍ P. Clote 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 633 KB

A Topology for the Space of Countable Mo

A Topology for the Space of Countable Models of a First Order Theory

✍ J. T. Baldwin; J. M. Plotkin 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 446 KB 👁 1 views

A family of nonbinary linear codes

✍ Thomas Bier 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 233 KB

A sharpening of the Johnson bound for bi

A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters

✍ A. E. Brouwer; L. M. G. M. Tolhuizen 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 163 KB

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

On the Extendability of Linear Codes

✍ Tatsuya Maruta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Symposium on Inform. Theory, Whistler, Canada,'' pp. 345) proved that every [n, k, d] O code with gcd(d, q)"1 and with all weights congruent to 0 or d (modulo q) is extendable to an O code with all weights congruent to 0 or d#1 (modulo q). We give another elementary geometrical proof of this theor