Perfect t-codes in Cayley graphs of groups

DOI10.1142/S1793830921501019zbMath1482.05144OpenAlexW3129145462MaRDI QIDQ5063278

Neda Bagheri, A. Asghar Talebi Rostami

Publication date: 17 March 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501019

zbMATH Keywords

Cayley graphdihedral groupdecodingefficient dominating setperfect \(t\)-code

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Tilings in Lee metric
• On perfect Lee codes
• Perfect codes in the discrete simplex
• Perfect codes in graphs
• A new approach towards the Golomb-Welch conjecture
• Quasi-Perfect Lee Codes of Radius 2 and Arbitrarily Large Dimension
• Perfect Codes in Cayley Graphs
• Perfect Codes in the Lee Metric and the Packing of Polyominoes

This page was built for publication: Perfect t-codes in Cayley graphs of groups