In this work we propose the hypothesis that replacing the current system of representing the chemical entities known as amino acids using Latin letters with one of several possible alternative symbolic representations will bring significant benefits to the human construction, modification, and analysis of multiple protein sequence alignments. We propose ways in which this might be done without ...

This research paper presents a proposed method for the compression of medical images using hybrid compression technique (DWT, DCT and Huffman coding). The objective of this hybrid scheme is to achieve higher compression rates by first applying DWT and DCT on individual components RGB. After applying this image is quantized to calculate probability index for each unique quantity so as to find ou...

The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....

Molecular communication in nanonetworks is an emerging communication paradigm where molecules are used as information carriers. Concentration Shift Keying (CSK) and Molecule Shift Keying (MoSK) are being studied extensively for the short and medium range molecular nanonetworks. It is observed that MoSK outperforms CSK. However, MoSK requires different types of molecules for encoding which rende...

Some data compression techniques use large numbers of prefix-free codes. The following two techniques do so: adaptive Huffman encoding and bit recycling. Adaptive Huffman encoding allows successive symbols to be encoded where each one is encoded according to the statistics of the symbols seen so far. Bit recycling, on the other hand, is a technique that is designed to improve the efficiency of ...

A canonical Huffman code is an optimal prefix-free compression whose codewords enumerated in the lexicographical order form a list of binary words non-decreasing lengths. Gagie et al. (2015) gave representation this coding capable encoding and decoding symbol constant worst-case time. It uses σlg⁡ℓmax+o(σ)+O(ℓmax2) bits space, where σ ℓmax are alphabet size maximum codeword length, respectively...

Establishing secure communication links at a global scale is major potential application of quantum information science but also extremely challenging for the underlying technology. While milestone experiments using satellite-to-ground and exploiting singe-photon encoding implementing key distribution have shown recently that this goal achievable, it still necessary to further investigate pract...