I don't know the name of this problem and maybe there is already a solution for it. I am also NOT a mathematician.
I've some numerical input which comes in the form of vector or string such as "1.2.3". I can break those vectors/string down into the natural numbers 1, 2 and 3.
Assume I've N strings. I want to find a function f(string_1...string_n) = output
there must be a biunivocal relationship between the input and the output, meaning from the output have enough information to go back to the original input. The information domain of the output should be big enough so that there are no collisions. Each vector can go from 0.0.0 to 999999999.999999999.999999999
example:
assume 2 strings in input 1.2.3 and 4.5.6
I've been thinking of multiplication for example:
(1)(4)=4
(2)(5)=10
(3)(6)=18
This doesn't work because 4 can be also the result of 2*2 Maybe the solution is in some kind of invertible cipher where the key is the input itself? Any idea is welcome, thank you