✦ LIBER ✦

A class of q-ary codes

✍ Scribed by Kishore Sinha

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 90 KB
Volume: 126
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90293-3

No coin nor oath required. For personal study only.

✦ Synopsis

A class of q-ary (q 2 3) codes is constructed from nested balanced incomplete block designs.

Proof. (See Table 1.) Let an initial block of cyclic solution of the nested BIBD be arranged as (x I,X~Y..

📜 SIMILAR VOLUMES

On a class of Abelian codes

✍ Prabir Bhattacharya 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On level-weight studies of binary and m-

On level-weight studies of binary and m-ary gray codes

✍ Bhu Dev Sharma; Ravinder Kumar Khanna 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 378 KB

A Loopless Gray-Code Algorithm for Listi

A Loopless Gray-Code Algorithm for Listing k-ary Trees

✍ Dominique Roelants van Baronaigien 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 91 KB

The bit sequence representation for k-ary trees is a sequence b , b , . . . , b of bits that is formed by doing a preorder traversal of the k-ary tree and writing a 1 when the visited subtree is not empty and a zero when the visited subtree is empty. The representation is well known and in the cas

The preparata codes and a class of 4-des

The preparata codes and a class of 4-designs

✍ Alphonse H. Baartmans; Iliya Bluskov; Vladimir D. Tonchev 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

An extension theorem for t-designs is proved. As an application, a class of 4-(4" + 1,5,2) designs is constructed by extending designs related to the 3-designs formed by the minimum weight vectors in the Preparata code of length n = 4", m 2 2. 0 1994 John Wiley & Sons, Inc. ## 1 . INTRODUCTION We

A class of doubly even self dual binary

A class of doubly even self dual binary codes

✍ Jacques Wolfmann 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 268 KB

We give a construction of an infinite class of doubly even self dual binary codes including a code of length 112. (The study of such a code is closely related to the existence problem of a projective plane of order ten.)

On the Generalized Weights of a Class of

On the Generalized Weights of a Class of Trace Codes

✍ J.-P. Cherdieu; D.-J. Mercier; T. Narayaninsamy 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized H