Page 1

Displaying 1 – 2 of 2

Showing per page

Unique decipherability in the additive monoid of sets of numbers

Aleksi Saarela (2011)

RAIRO - Theoretical Informatics and Applications

Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all a A and b B . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.

Unique decipherability in the additive monoid of sets of numbers

Aleksi Saarela (2011)

RAIRO - Theoretical Informatics and Applications

Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all a A and b B . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.

Currently displaying 1 – 2 of 2

Page 1