A coding method, a decoding method, a coder, and a decoder, where the coding method includes obtaining the pulse distribution, on a track, of the pulses to be encoded on the track, determining a distribution identifier for identifying the pulse distribution according to the pulse distribution, and generating a coding index that includes the distribution identifier. The decoding method includes receiving a coding index, obtaining a distribution identifier from the coding index, wherein the distribution identifier is configured to identify the pulse distribution, on a track, of the pulses to be encoded on the track, determining the pulse distribution, on a track, of all the pulses to be encoded on the track according to the distribution identifier, and reconstructing the pulse order on the track according to the pulse distribution.

A processing system is provided that includes a memory for storing an input bit stream and a processing logic, operatively coupled to the memory, to generate a first score based on: a first set of matching data related to a match between a first bit subsequence and a candidate bit subsequence within the input bit stream, and a first distance of the candidate bit subsequence from the first set of matching data. A second score is generated based on a second set of matching data related to a match between a second bit subsequence and the candidate bit subsequence, and a second distance of the candidate bit subsequence from the second set of matching data. A code to replace the first or second bit subsequence in an output bit stream is identified. Selection of the one of the bit subsequences to replace is based on a comparison of the scores.

An information transmission method, apparatus and system, which relate to the field of terminal information interaction provides a cross-terminal information transmission manner that does not need a wireless data link, and is reliable and secure. A first terminal transfers information through vibration and a second terminal obtains, by detecting the vibration, the information transferred by the first terminal.

Various systems and methods for lossless data compression are described herein. A process for lossless data compression includes hashing an input byte stream to produce a hash key; identifying a set of dictionary entries in a hash table using the hash key, the hash key associated with a word from a compact dictionary; identifying a set of candidate words from the compact dictionary based on the identified set of dictionary entries, the compact dictionary being a subset of a standard dictionary; determining a best match of the set of candidate words with the input byte stream; and encoding the best match of the set of candidate words as a compressed output of the input byte stream, the encoding including an operation to determine an index into the standard dictionary of the best match and using the index in the encoding operation.

An encoder is provided. The encoder is configured to analyze input data to identify at least one mode symbol therein. The encoder is configured to generate data values of a first type including non-mode symbols and data values of a second type including runs of the at least one mode symbol. Moreover, the encoder is configured to generate information that is indicative of a count of the non-mode symbols and information that is indicative of the at least one mode symbol. Furthermore, the encoder is configured to assemble or encode the information that is indicative of the at least one mode symbol, the information that is indicative of the count of the non-mode symbols, the data values of the first type including the non-mode symbols and the data values of the second type including the runs of the at least one mode symbol, to generate encoded data.

Aspects of dynamic data compression selection are presented. In an example method, as uncompressed data chunks of a data stream are compressed, at least one performance factor affecting selection of one of multiple compression algorithms for the uncompressed data chunks of the data stream may be determined. Each of the multiple compression algorithms may facilitate a different expected compression ratio. One of the multiple compression algorithms may be selected separately for each uncompressed data chunk of the data stream based on the at least one performance factor. Each uncompressed data chunk may be compressed using the selected one of the multiple compression algorithms for the uncompressed data chunk.

An information processing device includes: a memory configured to store data concerning a write access; and a processor coupled to the memory, the processor being configured to: record, for each data, time of a write access of the data to management information, when writing out data from the memory to a storage, determine a plurality of data as a group of overall compression based on the management information, the plurality of data having a difference of time of write accesses being equal to or less than a threshold value, and compress the plurality of data corresponding to the determined group by an overall compression, and write compressed data obtained through the overall compression to the storage.

A processor includes a memory hierarchy, buffer, and a compression module. The compression module includes logic to evaluate a stream of data to be compressed according to a compression scheme, selectively modify a format of the compression scheme based upon a number of literals received, compress a sequence of the data to produce the output data sequence, and send the output data sequence to the memory hierarchy.

A system and methods for upsampling of decompressed genomic data after lossy compression using a neural network integrates AI-based techniques to enhance compression quality. It incorporates a novel deep-learning neural network that upsamples decompressed data to restore information lost during lossy compression, taking advantage of cross-correlations between genomic data sets.

Techniques are provided for implementing additional compression for existing compressed data. Format information stored within a data block is evaluated to determine whether the data block is compressed or uncompressed. In response to the data block being compressed according to a first compression format, the data block is decompressed using the format information. The data block is compressed with one or more other data blocks to create compressed data having a second compression format different than the first compression format.