Abstract
The subschemes of the Hamming schemes H(n, q) for q greater than or equal to 4 are studied. We prove that there are no nontrivial subschemes when q > 4 and there exists only one nontrivial subscheme when q = 4.
| Original language | English |
|---|---|
| Pages (from-to) | 119-128 |
| Number of pages | 10 |
| Journal | Acta Applicandae Mathematicae |
| Volume | 29 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 1 Nov 1992 |
| Externally published | Yes |
Keywords
- Mathematics Subject Classification (1991): 05E30
ASJC Scopus subject areas
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Subschemes of Hamming association schemes H(n, q), q≥4'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver