New classes of reversible cellular automata

Abstract

A Boolean function $f$ on $k$~bits induces a shift-invariant vectorial Boolean function $F$ from $n$ bits to $n$ bits for every $n\ge k$. If $F$ is bijective for every $n$, we say that $f$ is a proper lifting, and it is known that proper liftings are exactly those functions that arise as local rules of reversible cellular automata. We construct new families of such liftings for arbitrary large $k$ and discuss whether all have been identified for $k\le 6$.

11 pages