For the fulltext of the paper visit:
1) tot_comb.cpp - For a given number of maximum "1" bits (n), finds the number of permutations which can be generated using 1<=k<=n "1" bits and corresponding n-k "0" bits. This is useful in deciding the minimum number of bits required to generate unique bitpatterns for a specified network size.
2) collision.cpp - For a specified number of bits and network size, runs an exhaustive search algorithm to find out whether the given number of bits will generate a bit pattern scheme for all the nodes of the network which results in unique bit patterns for all the combination of packet collision. Output file patterns.dat generates the initial bit patterns which resulted in unique patterns. Output file result.dat generates the results of the combination of all packet collision.
3) unique_notunique.cpp - Given a matrix of binary bit patterns, the program tells whether that given binary bit pattern generate combination packet collisions which are unique or not.
Using the exhaustive search approach, we were only able to find optimal solution for a network of size 7 receivers.