Compression Algorithm Based on Irregular Sequence

The paper introduces a new lossless, highly robust compression algorithm that similar with LZW algorithm, yet the algorithm discards dictionary processing and uses irregular sequences with massive, random information instead. Then the paper found the ineffectiveness of the algorithm due to limited computing ability of hardware and made a few improvements to the algorithm. The algorithm is recommended to be applied in interplanetary communications between a high-compute-ability device and a low-compute-ability receiving device, whose signal would be easily interfered by cosmos rays.Comment: 4 pages, 6 figures, accepted by 2020 The 4th International Conference on Graphics and Signal Processing (ICGSP, http://www.icgsp.org/index.html), yet has not been publishe

Longest common substrings with k mismatches

The longest common substring with k-mismatches problem is to find, given two strings S-1 and S-2, a longest substring A(1) of S-1 and A(2) of S-2 such that the Hamming distance between A(1) and A(2) isPeer reviewe