Discrete orthogonal multiplicationless transformations in the Galua field are considered. An efficient implementation is achieved by representing data in a number system generated by a linear recurrent sequence (such as the Fibonacci codes, the `golden' proportion and their generalizations).