• Corpus ID: 212439287

Entropy Coding and Different Coding Techniques

@inproceedings{Kaur2016EntropyCA,
  title={Entropy Coding and Different Coding Techniques},
  author={Sandeep Kaur and Mohali Sukhjeet Singh},
  year={2016}
}
In today’s digital world information exchange is been held electronically. So there arises a need for secure transmission of the data. Besides security there are several other factors such as transfer speed, cost, errors transmission etc. that plays a vital role in the transmission process. The need for an efficient technique for compression of Images ever increasing because the raw images need large amounts of disk space seems to be a big disadvantage during transmission & storage. This paper… 
JPEG 2000 Compression Standard-An Overview
TLDR
The main feature of JPEG 2000 is it supports both lossless and lossy compression, and a framework for evaluation and the benefits are presented.
Partial Gated Feedback Recurrent Neural Network for Data Compression Type Classification
TLDR
A Partial Gated Feedback Recurrent Neural Network (PGF-RNN) is proposed for the identification of lossless compression algorithms and modified the gated recurrent units to improve the correlation of layers by grouping the fully-connected layers to effectively determine the characteristics of the compressed data.
Preservation of Multimedia Confidentiality using Elliptic Curve
TLDR
This book presents a treatment of the determinants of infectious disease and its causes in eight distinct phases: diarrhoea, vomiting, diarrhoeas, fever, constipation, encephalitis, septicaemia, and so on.

References

SHOWING 1-10 OF 12 REFERENCES
P-adic arithmetic coding
TLDR
It is shown that for p = 2 the algorithm works as integer variant of arithmetic coding; for a special class of models it gives exactly the same codes as Huffman's algorithm, for another special model and a specific alphabet it gives Golomb-Rice codes.
Generalized Kraft Inequality and Arithmetic Coding
TLDR
This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within ∈, which is comparable to that of conventional coding methods.
Arithmetic coding for data compression
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates
A method for the construction of minimum-redundancy codes
  • D. Huffman
  • Computer Science, Business
    Proceedings of the IRE
  • 1952
TLDR
A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Introduction to Algorithms, Second Edition
TLDR
The complexity class P is formally defined as the set of concrete decision problems that are polynomial-time solvable, and encodings are used to map abstract problems to concrete problems.
Arithmetic coding" (PDF). IBM Journal of Research and Development
  • 1979
Chapter 6: Stream Codes". Information Theory, Inference, and Learning Algorithms (PDF/PostScript/DjVu/LaTeX). Cambridge University Press.ISBN 0-521-64298-1
  • Archived from the original on
  • 2003
Section 22.6. Arithmetic Coding". Numerical Recipes: The Art of Scientific Computing (3rd ed.)
  • 2007
" Arithmetic coding " ( PDF )
  • IBM Journal of Research and Development
Arithmetic Coding for Data Compression" (PDF)
  • Communications of the ACM
  • 1987
...
...