#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1985

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, Takuya Kida
- 2014 Data Compression Conference
- 2014

In this paper, we propose a simple method for direct access to variable-to-fixed length codes (VF codes) by adding an auxiliary succinct index structure to the encoded text. The method solves the substring decompression problem in O(N/n+l) time in the average case, where N, n, and l are the original text length, the encoded text length, and the length of… (More)

- Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida
- 2013 Data Compression Conference
- 2013

The Re-Pair algorithm proposed by Larsson and Moffat in 1999 is a simple grammar-based compression method that achieves an extremely high compression ratio. However, Re-Pair is an offline and very space consuming algorithm. Thus, to apply it to a very large text, we need to divide the text into smaller blocks. Consequently, if we share a part of the… (More)

- Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, Takuya Kida
- 2014 Data Compression Conference
- 2014

We address the problem of applying the Re-Pair [LM99] algorithm to large texts. The Re-Pair algorithm (Re-Pair) proposed by Larsson and Moffat in 1999 is a simple grammar-based compression method that achieves an extremely good compression ratio. However, Re-Pair is not applicable to a large text because it consumes much memory and runs in an offline… (More)

- Shinichi Ota, Kei Sekine, Takanori Terashima, Kazuo Tajima, Shinsuke Iida
- Kango kenkyu. The Japanese journal of nursing…
- 1985

- ‹
- 1
- ›