Project is about lossless compression of data (LCOD), of which a very large integer (decimal) being represented
Question:
Project is about lossless compression of data (LCOD), of which a very large integer (decimal) being represented by any method of math equation that will use less data bits in a storage or to be transmitted. For example, 10000 = 10^4 will save one bit of space when the decimal is converted into the math equation.
Mr group member has determined that it is impossible to find such saving for ANY integer. Otherwise any expression of other solutions will actually take more space instead. While it is possible to use higher base of digital system, the saving is not that significant.
Can Unary numeral system make efficient LCOD? For example, any integer of decimal number could be first converted into unary number and then use a cuboid to represent the LOCD? If one cuboid can't solve the LOCD, will two or more LOCD cuboid can solve the task?
Niebels Methods, Standards and Work Design
ISBN: 978-0073376318
13th edition
Authors: Andris Freivalds, Benjamin Niebel