摘要

Viewing array convolution as a commutative and associative multiplication, we furnish the set of all m x n arrays with the structure of a C-algebra. We show that this allows a very efficient description of array manipulations and constructions. This is demonstrated by translating the technical polynomial construction of the almost perfect arrays given by Arasu and de Launey to a concise algebraic description.

  • 出版日期2015-12