Abstract: A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed-Solomon codes as a special case. In general, the code symbols ...
Abstract: We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of polynomials ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results