This paper presents a hardware-friendly solution for external memory bandwidth reduction focusing in the state-ofart video encoders, like H.264/AVC and HEVC. The proposed approach is based on reference frame compression using an adaptation of the traditional Huffman algorithm and is a lossless solution. This solution is entitled RFCAVLC8t (Reference Frame Context Adaptive Variable-Length Coder ...

Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, in this paper, a method that adds secrecy to this well-known source code is proposed. Finite state arithmetic code is used as source code to add security. Its finite state machine characteristic is exploited to insert some random jumps during source coding process. I...

Traditional text compression algorithms such as Huffman and LZ variants are usually based on 8-bit characters sampling. However, under the unicode representation for multilingual information, the character set of each language such as Chinese and Japanese is consisted of a very number of distinct characters and thus 16-bit or 32-bit character sampling is needed. Consequently, when text compress...

As malware evolves and becomes more complex, researchers strive to develop detection classification schemes that abstract away from the internal intricacies of binary code represent without need for architectural knowledge or invasive analysis procedures. Such approaches can reduce complexities feature generation simplify process. In this paper, we present efficient Huffman features (eHf), a no...

Current scanning access methods for text generation in AAC devices are limited to relatively few options, most notably row/column variations within a matrix. We present Huffman scanning, a new method for applying statistical language models to binary-switch, static-grid typing AAC interfaces, and compare it to other scanning options under a variety of conditions. We present results for 16 adult...