ON BOUNDS AND IMPLEMENTATION OF ARITHMETIC CODES,

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)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1969
Accession Number
AD0695763

Entities

People

  • Sejune Hong

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Arithmetic
  • Coding
  • Decoding
  • Message Decoding
  • Notation

Readers

  • Approximation Theory.
  • Computer Programming and Software Development.