Redundancy of minimal weight expansions in Pisot bases

Abstract. Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer n as a sum n = k εkUk, where the digits εk are taken from a finite alphabet Σ and (Uk)k is a linear recurrent sequence of

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Peter J. Grabner, Wolfgang Steiner
• Keywords: CORR 2011, Education, Linear Recurrent Sequence, Redundant Number Representations, finite Alphabet