✦ LIBER ✦

Codes within codes

✍ Scribed by J. Wolfowitz

Publisher: Springer
Year: 1979
Tongue: English
Weight: 402 KB
Volume: 46
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00538118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The code within the codons

✍ F.J.R. Taylor; D. Coates 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Intersecting codes and partially identif

Intersecting codes and partially identifying codes

✍ G. Cohen; S. Encheva; S. Litsyn 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 508 KB

New Codes via the Lengthening of BCH Cod

New Codes via the Lengthening of BCH Codes with UEP Codes

✍ Jürgen Bierbrauer; Yves Edel; Ludo Tolhuizen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We describe a code lengthening technique that uses unequal error protection codes as su$x codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain "ve new binary codes, 13 new ternary codes, and 13 new quarternary codes. An improvemen

Ternary Covering Codes Derived from BCH

Ternary Covering Codes Derived from BCH Codes

✍ John C Cock; Patric R.J Östergård 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 250 KB

It is shown how ternary BCH codes can be lengthened to get linear codes with covering radius 2. The family obtained has the ternary Golay code as its first code, contains codes with record-breaking parameters, and has a good asymptotic behavior. The ternary Golay code is further used to obtain short

Completely regular codes and completely

Completely regular codes and completely transitive codes

✍ Patrick Solé 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 511 KB

A binary code C is said to be completely regular if the weight distribution of any translate x + C depends only on the distance of x to C. Such codes are related to designs and distance regular graphs. Their covering radius is equal to their external distance. All perfect and uniformly packed codes

On codes, ω-codes and ω-generators

✍ S. Julia; I. Litovsky; B. Patrou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Up to now, the question "given a rational language R, how to decide if there exists an w-code C such that C" = R"?" remains with no general solution. We give an answer assuming that the greatest w-generator of R" exists and is a free submonoid. In the case where the greatest generator is generated b