• Title/Summary/Keyword: 접두 코드

Search Result 2, Processing Time 0.016 seconds

A Simple Integer Sequence Code System Supporting Random Access (임의 접근을 지원하는 간단한 정수 배열 코드 시스템)

  • Lee, Junhee;Satti, Srinivasa Rao
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.10
    • /
    • pp.594-598
    • /
    • 2017
  • Tremendous quantities of numerical data are generated every day from various sources, including the stock market. Universal codes such as Elias gamma coding, Elias delta coding and Fibonacci coding are generally used to store arrays of integers. Studies have been conducted to support fast access to specific elements in an integer array, while occupying less space. We suggest an improved code system that utilizes the concepts of succinct data structures. This system is based on a data structure that allows compressing a delimiter bit array while supporting queries in constant time. The results of an experiment show that the encoded array uses lower space, while not sacrificing time efficiency.

An Improvement of Still Image Quality Based on Error Resilient Entropy Coding for Random Error over Wireless Communications (무선 통신상 임의 에러에 대한 에러내성 엔트로피 부호화에 기반한 정지영상의 화질 개선)

  • Kim Jeong-Sig;Lee Keun-Young
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.3 s.309
    • /
    • pp.9-16
    • /
    • 2006
  • Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.