Low complexity inverse mappings on sum-distinct elements of a power set
Let \(\cup\), \(\bigtriangleup\), \(\uplus\) and \(+\) denote set-union, set- difference, multiset-union and real number addition, respectively. In this paper, the author considers complexity inverse mappings (algorithms which return the subset of a given sum) defined on sum-distinct elements from \((2^ S, \cup)\), \((2^ S, \bigtriangleup)\), \((2^ S, \uplus)\) and \((S_ n,+)\), where \(2^ S\) is the power set of \(S\) and \(S_ n= \{0,1,2, \dots, 2^ n-1\}\). It is proved that, within each of the above pairs, mappings are related to generating functions of the respective sum-distinct sets, and between compatible pairs they are related by a subset-sum property, e.g., if \(Z\in 2^ S\) is sum-distinct in \((2^ S,\cup)\), then \(Z\) is sum-distinct in \((2^ S\), \(\bigtriangleup\)).
- A Combinatory Detection Problem
- Determination of a Subset from Certain Combinatorial Properties
- Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- On a Combinatorial Problem in Number Theory
- On a problem in additive number theory
- scientific article; zbMATH DE number 3849235 (Why is no real title available?)
- scientific article; zbMATH DE number 554181 (Why is no real title available?)
- On inverse mappings of residue class representing sum-distinct sets obtained from hadamard matrices
- scientific article; zbMATH DE number 1998310 (Why is no real title available?)
This page was built for publication: Low complexity inverse mappings on sum-distinct elements of a power set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032914)
