Nearly perfect codes in distance-regular graphs
type: Item
instance of: scholarly article
title: Nearly perfect codes in distance-regular graphs
zbMATH Open document ID: 0339.94004
DOI: 10.1016/0012-365X(76)90004-2
published in: Discrete Mathematics
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 3531276
author: Peter Hammond
MaRDI profile type: Publication
cites work: Perfect codes in graphs
cites work: A new 5‐arc‐transitive cubic graph
cites work: Q5707657
cites work: Antipodal covering graphs
cites work: Nearly perfect binary codes
cites work: Perfect codes in the graphs \(O_k\)
cites work: A class of optimum nonlinear double-error-correcting codes
cites work: PRIMITIVE AND IMPRIMITIVE GRAPHS
description: scientific article; zbMATH DE number 3531276