Tight 2-designs and perfect 1-codes in Doob graphs
type: Item
instance of: scholarly article
title: Tight 2-designs and perfect 1-codes in Doob graphs
zbMATH Open document ID: 0974.05011
DOI: 10.1016/S0378-3758(99)00126-3
published in: Journal of Statistical Planning and Inference
publication date: 2001-09-13T00:00:00Z
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 1471128
zbMATH Keywords: Doob graphs
zbMATH Keywords: distance-regular graphs
zbMATH Keywords: Hamming graphs
zbMATH Keywords: perfect 1-codes
zbMATH Keywords: tight 2-designs
author: Jack H. Koolen
author: Akihiro Munemasa
describes a project that uses: GRAPE
describes a project that uses: GAP
MaRDI profile type: Publication
cites work: Q3218140
cites work: Perfect codes in graphs
cites work: On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
cites work: Four fundamental parameters of a code and their combinatorial significance
cites work: Q5707657
cites work: Q4074938
cites work: Q3137758
cites work: On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\)
cites work: Q4146667
cites work: On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
cites work: The Uniqueness of the $\mathrm{L}_2$ Association Scheme
cites work: Q4273617
full work available at URL: s0378-3758(99)00126-3
OpenAlex ID: W2008192074
Wikidata QID: Q127185659
description: scientific article; zbMATH DE number 1471128