  This paper examines the theory pertaining to lossless compression of
correlated sources located at the edge of a network. Importantly, communication
between nodes is prohibited. In particular, a method that combines correlated
source coding and matrix partitioning is explained. This technique is then made
more flexible, by restricting the method to operate on two distinct groups of
nodes. As a result, this new method allows for more freedom in compression
performance, with consequent trade-off in node integrity validation.
Specifically, it provides 2-3 times the compression savings when using a
Hamming(7,4) with 4 nodes. It also decreases the complexity with regard to
managing the nodes as they join/leave the network, while retaining the range
within which the information can be losslessly decoded.
