✦ LIBER ✦

Divisibility of Codes Meeting the Griesmer Bound

✍ Scribed by Harold N. Ward

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 287 KB
Volume: 83
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2864

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Projective codes meeting the Griesmer bo

Projective codes meeting the Griesmer bound

✍ Tor Hellesth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

## Helleseth, T., Projective codes meeting the Griesmer bound, Discrete Mathematics 106/107 (1992) 265-271. We present a brief survey of projective codes meeting the Griesmer bound. Methods for constructing large families of codes as well as sporadic codes meeting the bound are given. Current res

Construction of Some Optimal Ternary Lin

Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound

✍ N. Hamada; Helleseth T. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 415 KB

The Divisible Code Bound Revisited

✍ Harold N. Ward 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a character-free proof of the divisible code bound and some applications.

Higher Weights of Anticodes and the Gene

Higher Weights of Anticodes and the Generalized Griesmer Bound

✍ Dmitrii Yu. Nogin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 146 KB

We show that the minimum r-weight d P of an anticode can be expressed in terms of the maximum r-weight of the corresponding code. As examples, we consider anticodes from homogeneous hypersurfaces (quadrics and Hermitian varieties). In a number of cases, all di!erences (except for one) of the weight

Quasi-Symmetric Designs and Codes Meetin

Quasi-Symmetric Designs and Codes Meeting the Grey–Rankin Bound

✍ Gary McGuire 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 261 KB

We give a characterization of codes meeting the Grey Rankin bound. When the codes have even length, the existence of such codes is equivalent to the existence of certain quasi-symmetric designs. We also find the parameters of all linear codes meeting the Grey Rankin bound. ## 1997 Academic Press T

A survey of recent works with respect to

A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry

✍ Noboru Hamada; Michel Deza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 810 KB