Open Access
On Bounds and Implementation of Arithmetic Codes
TLDR
The upper bound on the rate of the arithmetic code is derived and a simple decoding method is presented for a general multiple error correction.Abstract:
: The upper bound on the rate of the arithmetic code is derived. Comparisons to actual rates are presented. Some codes have rates very close to this bound. A simple decoding method is presented for a general multiple error correction. The time required for the decoding depends on the decoding index k. For a small decoding index, the decoding can be much faster by using some parallel hardwares. (Author)read more
Citations
More filters
Book ChapterDOI
Error-correcting codes in computer arithmetic.
James L. Massey,Oscar N. Garcia +1 more
TL;DR: This chapter is intended to summarize the most important results which have been obtained in the theory of coding for the correction and detection of errors in computer arithmetic.
Some aspects of the norm representation for arithmetic checking and correcting codes
C. L. Chiang,I. S. Reed +1 more
TL;DR: The properties of the norm representation for integers are extensively investigated, a norm group is defined and the total number of its equivalence classes is found and the number of elements in each equivalence class is computed.
References
More filters
Journal ArticleDOI
A decoding procedure for multiple-error-correcting cyclic codes
TL;DR: A decoding procedure for multiple-error-correcting cyclic codes is described, which is very simple in principle and the mechanization is easy for short codes with relatively high redundancy.
Journal ArticleDOI
Arithmetic codes with large distance
TL;DR: A generalized burst-error correcting code is constructed and it is pointed out that the above large distance codes may be utilized in the construction of this burst- error code.
Journal ArticleDOI
Some results in the theory of arithmetic codes
TL;DR: The presented analysis is used as a guide for the construction of many codes of moderate distance and high rate which lie between the two known extremes of the single-error correcting Brown codes and of the maximum-sequence-like codes of Barrows and Mandelbaum.