𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new class of nonbinary codes meeting the Griesmer bound

✍ Scribed by Noboru Hamada; Tor Helleseth; Øyvind Ytrehus

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
390 KB
Volume
47
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Divisibility of Codes Meeting the Griesm
Divisibility of Codes Meeting the Griesmer Bound
✍ Harold N. Ward 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We prove that if a linear code over GF( p), p a prime, meets the Griesmer bound, then if p e divides the minimum weight, p e divides all word weights. We present some illustrative applications of this result.

On the nonexistence of some quaternary l
On the nonexistence of some quaternary linear codes meeting the Griesmer bound
✍ Noboru Hamada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 176 KB

It is unknown whether or not there exists a quaternary linear code with parameters [293, 5, 219], [289, 5, 216] or [277, 5, 207]. The purpose of this paper is to prove the nonexistence of quaternary linear codes with parameters [

On the construction of [q4+q2−q, 5,q4−q3
On the construction of [q4+q2−q, 5,q4−q3+q2− 2q;q]-codes meeting the Griesmer bound
✍ Noboru Hamada; Tor Helleseth; Øyvind Ytrehus 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 237 KB

It is unknown whether or not there exists an [87, 5, 57 ; 31-code. Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q4 + q2 \_ q, 5, q'\* -q3 + q2 \_ 2q; q]-codes for any prime power q \_> 3. As a special case, it is shown that