An application of difference sets to a problem concerning graphical codes
type: Item
instance of: scholarly article
title: An application of difference sets to a problem concerning graphical codes
zbMATH Open document ID: 0881.05027
DOI: 10.1016/S0378-3758(96)00166-8
author: Dieter Jungnickel
author: Scott A. Vanstone
published in: Journal of Statistical Planning and Inference
publication date: 1997-09-04T00:00:00Z
review text: The authors prove that a binary code generated by a complete graph on \(n\) nodes is contained in some Hamming code if and only if \(n=2,3\), or 6.
Mathematics Subject Classification ID: 05B10
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 1057374
zbMATH Keywords: difference set
zbMATH Keywords: binary code
zbMATH Keywords: Hamming code
reviewed by: David P. Brown
MaRDI profile type: Publication
cites work: Q3737429
cites work: Q5422499
cites work: Decoding of graph theoretic codes (Corresp.)
cites work: Graph theoretic error-correcting codes
cites work: Graphical codes revisited
cites work: Q4717031
cites work: Q4146667
cites work: The diophantine equation \(x^2+7=2^n\)
cites work: Q3946078
full work available at URL: s0378-3758(96)00166-8
OpenAlex ID: W1973852059
Recommended article: An application of coding theory to a problem in graphical enumeration
Recommended article: Duadic codes and difference sets
Recommended article: Codes from Difference Sets
Recommended article: Q5578815
Recommended article: Application of coding theory to the construction of the Singer difference sets†
Recommended article: Grassmannian codes from paired difference sets
Recommended article: An Application of Set Theory to Coding Theory
Recommended article: On Abelian difference set codes
Recommended article: Disjoint difference sets, difference triangle sets, and related codes
Recommended article: Q4793311
description: scientific article; zbMATH DE number 1057374