Unconditional Bases and Bit-Level Compression
β Scribed by David L. Donoho
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 153 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1063-5203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Experimental results show that a word-based arithmetic coding scheme can achieve a higher compression performance for Chinese text. However, an arithmetic coding scheme is a fractional-bit compression algorithm which is known to be time consuming. In this article, we change the direction to study ho
## Abstract We prove that every unconditional basis of __l__~__p__~β__l__~__q__~ (0 < __p__ < __q__ < 1) is a disjoint union of two subsequences which span subspaces isomorphic to __l__~__p__~ and __l__~__q__~ respectively. This is an extension of a similar result of EDELSTEIN and WOJTASZCZYK [3] f
## Abstract This article proposes a new fragile watermarking scheme named bitβplane watermarking (BPW) which considers ways to improve coding efficiency whereas providing watermarking capability. Because of the use of the runβlength coding strategy for embedding watermark information, the BPW not o