Perfect codes in generalized Fibonacci cubes

arXiv1801.04106MaRDI QIDQ6296374FDOQ6296374

Publication date: 12 January 2018

Abstract: The {em Fibonacci cube} of dimension

n

, denoted as

G a m m a_{n}

, is the subgraph of the

n

-cube

Q_{n}

induced by vertices with no consecutive 1's. In an article of 2016 Ashrafi and his co-authors proved the non-existence of perfect codes in

G a m m a_{n}

for

n g e q 4

. As an open problem the authors suggest to consider the existence of perfect codes in generalization of Fibonacci cubes. The most direct generalization is the family

G a m m a_{n} (1^{s})

of subgraphs induced by strings without

1^{s}

as a substring where

s g e q 2

is a given integer. We prove the existence of a perfect code in

G a m m a_{n} (1^{s})

for

n = 2^{p} - 1

and

s g e q 3. 2^{p - 2}

for any integer

p g e q 2

.

This page was built for publication: Perfect codes in generalized Fibonacci cubes

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