Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428493 | Information Processing Letters | 2016 | 4 Pages |
Abstract
•Fibonacci cubes are isometric subgraphs of hypercubes and form an appealing model for interconnection networks.•The study of codes in graphs presents a wide generalization of the problem of the existence of classical error-correcting codes.•In this paper, it is proved that Fibonacci cubes do not admit any perfect code, unless the dimension is less than or equal to 3.
The Fibonacci cube ΓnΓn is obtained from the n -cube QnQn by removing all the vertices that contain two consecutive 1s. It is proved that ΓnΓn admits a perfect code if and only if n≤3n≤3.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khadijeh Fathalikhani, Sandi Klavžar,