๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nonlinear recurrences and arithmetic codes

โœ Scribed by Johannes Mykkeltveit

Book ID
114037251
Publisher
Elsevier Science
Year
1977
Weight
699 KB
Volume
33
Category
Article
ISSN
0019-9958

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Equidistant Arithmetic Codes and Charact
Equidistant Arithmetic Codes and Character Sums
โœ D.M. Gordon ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 329 KB

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

On the covering radius of cyclic linear
On the covering radius of cyclic linear codes and arithmetic codes
โœ Tor Helleseth ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC