Fractal digital sums and codes
✍ Scribed by Peter J. Grabner; Tamás Herendi; Robert F. Tichy
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 514 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Coding-theoretical methods are used to obtain improved lower bounds for character sums induced by a multiplicative character of an arbitrary order over GF(q).
This paper proposes a digital watermarking scheme based on fractal image coding with DCT coefficient and needs no information about the original image. In previous work, we have proposed the digital watermarking scheme based on fractal image coding with a DCT coefficient between the range block and
A cyclic arithmetic code is a subgroup of \(\mathbf{Z} /\left(r^{n}-1\right) \mathbf{Z}\), where the weight of a word \(x\) is the minimal number of nonzero coefficients in the representation \(x \equiv \sum_{i=0}^{n-1} c_{i} r^{i}\) with \(\left|c_{i}\right|<r\) for all \(i\). A code is called equi