Shmuel Tomi Klein | Bar-Ilan University (original) (raw)

Uploads

Papers by Shmuel Tomi Klein

Research paper thumbnail of Weighted Burrows–Wheeler Compression

SN computer science, Mar 17, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Optimal Partitioning of Data Chunks in Deduplication Systems

Prague Stringology Conference, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Synchronizing Dynamic Huffman Codes

Prague Stringology Conference, 2018

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Accelerated Partial Decoding in Wavelet Trees

Prague Stringology Conference, 2016

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Searching for a Set of Correlated Patterns

Springer eBooks, 2004

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Context Sensitive Flash Codes

The Computer Journal, Jan 9, 2021

A major property of flash memory is that a 0-bit can be changed into a 1-bit, but the symmetric t... more A major property of flash memory is that a 0-bit can be changed into a 1-bit, but the symmetric task of switching from a 1-bit to a zero may only be performed in blocks and is therefore often prohibited. This led to the development of rewriting codes using the same storage space more than once, subject to the constraint that 0-bits can be changed into 1-bits, but not vice versa. Context sensitive rewriting codes extend this idea by also incorporating information gathered from surrounding bits. Several new context sensitive rewriting codes are presented and analyzed, some of which are better than the state of the art for sparse input. Empirical simulations show a good match with the theoretical results.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Modeling Delta Encoding of Compressed Files

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Semi-lossless text compression

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A space efficient direct access data structure

Journal of Discrete Algorithms, Mar 1, 2017

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Ternary Fibonacci Codes

Lecture Notes in Computer Science, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Improved Alignment Based Algorithm for Multilingual Text Compression

Springer eBooks, 2011

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Extraction from Huffman Encoded Files

Prague Stringology Conference, 2015

Bookmarks Related papers MentionsView impact

Research paper thumbnail of An overhead reduction technique for mega-state compression schemes

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Guided blocks WOM codes

Information Processing Letters, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Weighted Adaptive Coding

arXiv (Cornell University), May 17, 2020

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Huffman Coding with Non-sorted Frequencies

DCC, Mar 1, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The String-to-Dictionary Matching Problem

The Computer Journal, Feb 17, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the Randomness of Compressed Data

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Compression of a Set of Correlated Bitmaps

International ACM SIGIR Conference on Research and Development in Information Retrieval, 1991

In large IR systems, information about word occurrence may be stored as a bit matrix, with rows c... more In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the l-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Random Access to Fibonacci Codes

Prague Stringology Conference, 2014

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Weighted Burrows–Wheeler Compression

SN computer science, Mar 17, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Optimal Partitioning of Data Chunks in Deduplication Systems

Prague Stringology Conference, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Synchronizing Dynamic Huffman Codes

Prague Stringology Conference, 2018

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Accelerated Partial Decoding in Wavelet Trees

Prague Stringology Conference, 2016

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Searching for a Set of Correlated Patterns

Springer eBooks, 2004

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Context Sensitive Flash Codes

The Computer Journal, Jan 9, 2021

A major property of flash memory is that a 0-bit can be changed into a 1-bit, but the symmetric t... more A major property of flash memory is that a 0-bit can be changed into a 1-bit, but the symmetric task of switching from a 1-bit to a zero may only be performed in blocks and is therefore often prohibited. This led to the development of rewriting codes using the same storage space more than once, subject to the constraint that 0-bits can be changed into 1-bits, but not vice versa. Context sensitive rewriting codes extend this idea by also incorporating information gathered from surrounding bits. Several new context sensitive rewriting codes are presented and analyzed, some of which are better than the state of the art for sparse input. Empirical simulations show a good match with the theoretical results.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Modeling Delta Encoding of Compressed Files

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Semi-lossless text compression

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A space efficient direct access data structure

Journal of Discrete Algorithms, Mar 1, 2017

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Ternary Fibonacci Codes

Lecture Notes in Computer Science, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Improved Alignment Based Algorithm for Multilingual Text Compression

Springer eBooks, 2011

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Enhanced Extraction from Huffman Encoded Files

Prague Stringology Conference, 2015

Bookmarks Related papers MentionsView impact

Research paper thumbnail of An overhead reduction technique for mega-state compression schemes

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Guided blocks WOM codes

Information Processing Letters, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Weighted Adaptive Coding

arXiv (Cornell University), May 17, 2020

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Huffman Coding with Non-sorted Frequencies

DCC, Mar 1, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The String-to-Dictionary Matching Problem

The Computer Journal, Feb 17, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the Randomness of Compressed Data

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Compression of a Set of Correlated Bitmaps

International ACM SIGIR Conference on Research and Development in Information Retrieval, 1991

In large IR systems, information about word occurrence may be stored as a bit matrix, with rows c... more In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the l-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Random Access to Fibonacci Codes

Prague Stringology Conference, 2014

Bookmarks Related papers MentionsView impact