✦ LIBER ✦

On m-ary Gray codes

✍ Scribed by Bhu Dev Sharma; Ravinder Kumar Khann

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 727 KB
Volume: 15
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(78)90020-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On cyclic codes which areq-ary images of

On cyclic codes which areq-ary images of linear codes

✍ C. Mouaha 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 434 KB

Intersections ofq-ary perfect codes

✍ F. I. Solov’eva; A. V. Los’ 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 175 KB

On (q, 1)-subnormal q-ary covering codes

✍ Iiro Honkala 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 583 KB

A class of q-ary codes

✍ Kishore Sinha 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 90 KB

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..