Extremal 1-codes in distance-regular graphs of diameter 3
type: Item
instance of: scholarly article
title: Extremal 1-codes in distance-regular graphs of diameter 3
zbMATH Open document ID: 1245.05036
author: Aleksandar Jurišić
author: Janoš Vidali
published in: Designs, Codes and Cryptography
publication date: 2012-07-31T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 6062575
zbMATH Keywords: distance-regular graphs
zbMATH Keywords: 1-codes
zbMATH Keywords: Krein condition
zbMATH Keywords: triple intersection numbers
zbMATH Keywords: nonexistence
zbMATH Keywords: algebraic combinatorics
MaRDI profile type: Publication
full work available at URL: s10623-012-9651-0
OpenAlex ID: W2082746365
cites work: Q3992965
cites work: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
cites work: Shilla distance-regular graphs
cites work: A characterization of \(P\)- and \(Q\)-polynomial association schemes
DOI: 10.1007/S10623-012-9651-0
Recommended article: Distance-regular graphs admitting a perfect 1-code
Recommended article: Classification of a class of distance-regular graphs via completely regular codes
Recommended article: Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
Recommended article: An algebraic characterization of completely regular codes in distance-regular graphs
Recommended article: Q4242209
Recommended article: Codes in Shilla distance-regular graphs
Recommended article: Q3829476
Recommended article: Distance regular graphs of diameter 3 and strongly regular graphs
Recommended article: Q3783324
Recommended article: A characterization of distance-regular graphs with diameter three
description: scientific article; zbMATH DE number 6062575