Perfect codes in direct products of cycles

DOI10.1016/J.ENDM.2005.06.034MaRDI QIDQ3439335zbMATH OpenOpenAlexFDO

Authors Simon Špacapan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.034

zbMATH Keywords

cyclesdirect product of graphserror-correcting codesperfect codes

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Combinatorial codes (94B25)

Cites work

• Characterizing r-perfect codes in direct products of two and three cycles
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 921905 (Why is no real title available?)
• Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
• Perfect codes in graphs
• Perfect r-domination in the Kronecker product of three cycles

Cited in

(6)

• Perfect codes in power graphs of finite groups
• Total perfect codes in Cayley graphs
• On graph-based codes over Ramanujan graphs: existence and design of infinite families
• Perfect codes and total perfect codes in intersection graphs of finite groups
• Subgroup perfect codes in the semi-dihedral groups
• An almost complete description of perfect codes in direct products of cycles

This page was built for publication: Perfect codes in direct products of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439335)