Splitting the information into non-overlapping chunks seems to be the problem ahead. Looking into the information as a vector space, we might ask if there exist a set of (non intersecting) subspaces that sums up to give the entire vector space (or the direct sum).
Showing that information is a vector space is not an easy task though. Depending on the class of information (for instance audio, text, image etc.) the vector space as well as the field over which it is defined changes. However a coding scheme can be associated with a vector space.
Depending on the dimension of the code we are able to divide the space into sufficient number of subspaces that will depend upon the number of relay nodes as well. Information splitting hence becomes a code splitting or rate splitting problem.
Showing that information is a vector space is not an easy task though. Depending on the class of information (for instance audio, text, image etc.) the vector space as well as the field over which it is defined changes. However a coding scheme can be associated with a vector space.
Depending on the dimension of the code we are able to divide the space into sufficient number of subspaces that will depend upon the number of relay nodes as well. Information splitting hence becomes a code splitting or rate splitting problem.
No comments:
Post a Comment