A Simple Parallel Algorithm for the Ziv-Lempel Encoding
スポンサーリンク
概要
- 論文の詳細を見る
Many Ziv-Lempel algorithms have a similar property, that is, slow encoding and fast decoding. This paper proposes a simple improved Ziv-Lempel algorithm to encode a large amount of data quickly as well as compactly by using multiple-processor system.
- 社団法人電子情報通信学会の論文
- 1998-04-25
著者
-
Iwata K
The Authors Are With The Department Of Information Science And Intelligent Systems Faculty Of Engine
-
Morii M
Univ. Tokushima Tokushima‐shi Jpn
-
Uyematsu T
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu T
The Author Is With The Department Of Electrical And Electronic Engineering Tokyo Institute Of Techno
-
IWATA Ken-ichi
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engin
-
MORII Masakatu
The authors are with the Department of Information Science and Intelligent Systems, Faculty of Engin
-
UYEMATSU Tomohiko
The author is with the Department of Electrical and Electronic Engineering, Tokyo Institute of Techn
-
OKAMOTO Eiji
The author is with School of Information Science, Japan Advanced Institute of Science and Technology
-
Okamoto Eiji
The Author Is With School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- The Efficient GMD Decoders for BCH Codes (Special Issue on Multiple-Valued Logic)
- On a Recursive Form of Welch-Berlekamp Algorithm
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
- A Simple Parallel Algorithm for the Ziv-Lempel Encoding
- An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
- Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
- Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
- Permutation Cipher Scheme Using Polynomials over a Field
- On Good convolutional Codes with Optimal Free Distance for Rates 1/2, 1/3 and 1/4
- New Weakness in the Key-Scheduling Algorithm of RC4
- Internal-State Reconstruction of a Stream Cipher RC4(Information Security)(Information Theory and Its Applications)
- Constructing Quantum Error-Correcting Codes for p^m-State Systems from Classical Error-Correcting Codes(Special Section on Information Theory and Its Applications)
- A Method for Improving Fast Correlation Attack Using Parity Check Equations Modifications (Information Security)