We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
—Embedded zero-tree coding in wavelet domain has drawn a lot of attention to the image compression applications. Among noteworthy zero-tree algorithms is the SPIHT algorithm. For...
: In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew ...
We present our experience in reorganizing an “inherited” monolithic piece of software in a component-based manner. We follow the guidelines of the UML Components in order to o...