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

A class of redundant arithmetic codes

โœ Scribed by G. K. Kladov; A. Ya. Shpil'berg


Publisher
Springer US
Year
1968
Tongue
English
Weight
194 KB
Volume
2
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On arithmetic class invariants
โœ A. Agboola; G. Pappas ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer ๐ŸŒ English โš– 184 KB
A class of q-ary codes
โœ Kishore Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 90 KB

A class of q-ary (q 2 3) codes is constructed from nested balanced incomplete block designs. Proof. (See Table 1.) Let an initial block of cyclic solution of the nested BIBD be arranged as (x I,X~Y..

On a class of Abelian codes
โœ Prabir Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB
On the covering radius of cyclic linear
โœ 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

On the insecurity of arithmetic coding
โœ John G. Cleary; Sean A. Irvine; Ingrid Rinsma-Melchert ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 863 KB