The (non-)existence of perfect codes in Fibonacci cubes
详细信息 查看全文
- 作者：Ali Reza Ashrafia ; Jernej Azarijab ; Azam Babaic ; Khadijeh Fathalikhania ; Sandi Klavžard ; e ; b ; sandi.klavzar@fmf.uni-lj.si" class="auth_mail" title="E-mail the corresponding author
- 关键词：Error-correcting code ; Perfect code ; Efficient dominating set ; Fibonacci cube ; Combinatorial problems
- 刊名：Information Processing Letters
- 出版年：2016
- 出版时间：May 2016
- 年：2016
- 卷：116
- 期：5
- 页码：387-390
- 全文大小：230 K
文摘
- •
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.