Adding digit vectors

MaRDI QIDQ6235724zbMATH OpenFDO

Authors Peter Hellekalek

Publication date 17 September 2012

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Abstract: In this paper, we study the different possibilities to add two vectors of digits of a given length $m$. Our results show that there are at least $2^{m-1}$ different additions of such vectors, while there exist only two types of addition that we may employ, addition with carry and addition without carry. The proofs of our results are elementary.

This page was built for publication: Adding digit vectors

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