No label defined (Q4538683)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1767697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1767697 |
Statements
16 July 2002
0 references
divisible codes
0 references
theorem of Ax
0 references
Reed-Muller codes
0 references
group algebra
0 references
Delsarte-McEliece theorem
0 references
polarization
0 references
self-dual codes
0 references
Gleason-Pierce theorem
0 references
Griesmer codes
0 references
optimal codes
0 references
divisible code bound
0 references
0 references
0 references
0 references
0 references
0.9025673
0 references
0.8990644
0 references
0 references
0.8943194
0 references
0.89033175
0 references
This paper is a survey on divisible codes and some of their properties. In section 1 the author gives a brief introduction to linear codes following an approach by Assmus and Mattson. A central notion is that of a divisible code, defined as a code for which every codeword has a weight divisible by some constant \(\Delta\). Section 2 is devoted to generalized Reed-Muller codes. Central results discussed here are the theorems of Ax and McEliece. Section 3 deals with the divisible code bound and divisibility properties of self-dual codes. The author states a divisible code version of the Gleason-Pearce theorem. The divisible code bound leads to a nice result by the author: Proposition 8. For a given constant \(\delta>1\), consider \([n,k]_q\) codes that are divisible by \(\Delta\) and for which \(k>n/\delta\). Then \(\Delta\) is bounded; and if \(\Delta>\delta\), then \(q\) is also bounded. Section 4 deals with optimal linear codes in the sense of the Griesmer bound. A central result in this section is the following. Theorem 9. Let \(C\) be a Griesmer code over \(GF(p)\), \(p\) a prime. Then if \(p^e\) divides the minimum weight, \(p^e\) is a divisor of the code. Possible generalizations to this theorem are discussed. The author states one such conjecture and proves it for the case of \(q=4\).
0 references