Back to search

NJIT

A data compression system using arithmetic code

Abstract

dc:description.abstract

<p>Generally it is difficult to compress data, from statistically unknown sources, with significant compression ratio. To achieve this, the compression scheme should have an ability to gather context information of the source, adaptively. For better compression, it is desirable to separate the context gathering scheme from coding itself. Arithmetic code is very flexible and can accept any kind of context gathering scheme which can generate probabilities. One context gathering algorithm which generates Markov type probability adaptively is studied and implemented in software using Arithmetic code. This scheme performs well and results in compression ratio better than any existing algorithms such as the Lempel-Ziv algorithm.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Choi, Seokrim
Contributors dc:contributor
  • Yeheskel Bar-Ness
  • Sol Rosenstark
  • Jacob Klapper

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/3088

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Choi, Seokrim. A data compression system using arithmetic code. https://digitalcommons.njit.edu/theses/3088