The (non-)existence of perfect codes in Fibonacci cubes

The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two consecutive 1s. It is proved that Γn admits a perfect code if and only if n ≤ 3. Key words: Error-correcting code; perfect code; efficient dominating set; Fibonacci cube. AMS Subj. Class: 94B60

• Type: Journal
• Year: 2016
• Where: IPL
• Authors: Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khadijeh Fathalikhani, Sandi Klavzar
• Keywords: IPL 2016