Codes based on complete graphs
type: Item
instance of: scholarly article
title: Codes based on complete graphs
zbMATH Open document ID: 0943.94012
DOI: 10.1007/BF00130575
author: Dieter Jungnickel
author: M. J. de Resmini
author: Scott A. Vanstone
published in: Designs, Codes and Cryptography
publication date: 1997-05-28T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 994661
zbMATH Keywords: embedding
zbMATH Keywords: even graphical code
zbMATH Keywords: complete graph
zbMATH Keywords: Hamming code
MaRDI profile type: Publication
cites work: Q3097395
cites work: Decoding of graph theoretic codes (Corresp.)
cites work: An updated table of minimum-distance bounds for binary linear codes
cites work: Graph theoretic error-correcting codes
cites work: An application of difference sets to a problem concerning graphical codes
cites work: Q4717031
cites work: Q4146667
cites work: Q3946078
description: scientific article; zbMATH DE number 994661