Low complexity inverse mappings on sum-distinct elements of a power set

References

• Aho , A. V. , Hopcrot , J. E. and Ullman , J. D. 1983 . Data Structures and Algorithms , Addison-Wesley Publ. Comp. .
   Google Scholar
• Bellman , R. and Shapiro , H. N. 1948 . On a problem in additive number theory . Annals of Mathematics , 49 : 333 – 340 .
   Google Scholar
• Cantor , D. G. and Mills , W. H. 1966 . Determination of a subset from certain combinatorial properties . Canad. J. Math. , 18 : 42 – 48 .
   Google Scholar
• Conway , J. H. and Guy , R. K. 1969 . Solution of a problem of P. Erdös . Colloquium Mathematicum , 20 ( 2 ) : 307 – 307 .
   Google Scholar
• Erdös , P. 1955, 1956 . “ Problems and results in additive number theory ” . In Colloque sur la Theorie des Nombres , 127 – 137 . Liege and Paris : Bruxelles . esp. p. 137
   Google Scholar
• Jevtić , D. B. 1991 . Optimum multiple access coding, Problem 91–2 . SIAM Review , 33 ( 1 ) : 114 – 115 .
   Google Scholar
• Jevtić , D. B. 1992 . Disjoint uniquely decodable codebooks for noiseless multiple access adder channels generated by integer sets . IEEE Trans. on Info. Theory , 38 ( 3 ) : 1142 – 1146 .
   Google Scholar
• Lindström , B. 1965 . On a combinatorial problem in number theory . Canad. Math. Bull. , 8 ( 4 ) : 477 – 490 .
   Google Scholar
• Smith P. Amer. Math. Monthly 1975 82 3 Problem E 2536, 300, Solutions and comments, 83, 6 (1976), 484
   Google Scholar
• Shapiro , H. S. 1960 . Problem E 1399 . Amer. Math. Monthly , 67 ( 82 ) : 697 – 697 .
   Google Scholar
• Söderberg , S. and Shapiro , H. S. 1963 . A combinatory detection problem . Amer. Math. Monthly , 70 : 1066 – 1070 .
   Web of Science ®Google Scholar