On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree(Algorithms and Data Structures)
スポンサーリンク
概要
- 論文の詳細を見る
The antidictionary of a string is the set of all words of minimal length that never appear in this string. Antidictionaries are in particular useful for source coding. We present a fast and memory-efficient algorithm to construct an antidictionary using a suffix tree. It is proved that the complexity of this algorithm is linear in space and time, and its effectiveness is demonstrated by simulation results.
- 社団法人電子情報通信学会の論文
- 2007-11-01
著者
-
MORITA Hiroyoshi
Graduate School of Information Systems, University of Electro-Communications
-
Morita Hiroyoshi
Graduate School Of Information Systems The University Of Electro-communications
-
Ota Takahiro
Dept. Of Electronic Engineering Nagano Prefectural Institute Of Technology
-
OTA Takahiro
Dept. of Electronic Engineering, Nagano Prefectural Institute of Technology
-
OTA Takahiro
Dept. of Computer & Systems Engineering, Nagano Prefectural Institute of Technology
関連論文
- Soft Decoding of Integer Codes and Their Application to Coded Modulation
- Evaluation of mutual anonymity in P2P networks (情報処理)
- Transcoding-after-Smoothing System for VBR MPEG Video Streaming
- Evaluation of mutual anonymity in P2P networks (情報セキュリティ)
- Evaluation of mutual anonymity in P2P networks (情報処理)
- Evaluation of mutual anonymity in P2P networks (ワイドバンドシステム)
- Multicast Communication for Video Broadcasting Service over IPv4 Network Using IP Option(Internet)
- Derivation on Bit Error Probability of Coded QAM Using Integer Codes(Communication Theory and Signals)
- Integer Codes Correcting Single Errors of Specific Types (±e_1, ±e_2,..., ±e_s)(Communication Theory and Signals)
- Codes over the Ring of Integers Modulo m (Special Section on Information Theory and Its Applications)
- On Analysis of Acceptable Region of a Statistical Multiplexer Based on Fractional Brownian Traffic Models
- On Construction of Reversible Variable-Length Codes Including Resynchronization Markers as Codewords
- On Multiple Smoothed Transmission of MPEG4 Video Stream
- On Multiple Smoothed Transmission of MPEG Video Streams(Image Coding, Information Theory and Its Applications)
- On Trimming Codewords of Arithmetic Codes
- Reversible Distribution Converter with Finite Precision Arithmetic
- Special Section on Information Theory and Its Applications
- On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
- On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree(Algorithms and Data Structures)
- Perfect (2, n) Threshold Secret Sharing Systems Based on Matrices with Constant Column Weight
- Soft Decoding of Integer Codes and Their Application to Coded Modulation
- On (±1) Error Correctable Integer Codes
- On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet
- Linear Complexity Construction of Antidictionaries
- An Upper Bound on Size of Antidictionary
- Construction of q-ary (2,n) Threshold Secret Sharing Systems
- On the Irreducibility of Certain Shifts of Finite Type
- Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding
- A Geographic Location-Based Distributed Routing System