A FRAMEWORK and the associated method, schema and design for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes including the purposes of encryption/decryption or compression/decompression or both. There is no assumption of the digital information to be processed before processing. A Universal Coder is invented and now Pigeonhole meets Blackhole.

A computer-implemented method for content-agnostic referencing of a binary data file, the method comprising: determining a length of the binary data file, the length comprising the number of bits of the binary data file; for the determined length, generating all permutations of data of the determined length; locating an index within the generated permutations, wherein the index is the starting position of the binary data file within the generated permutations; and using the length and the index to indicate the binary data file.

A framework and the associated method, schema and design for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes including the purposes of encryption/decryption or compression/decompression or both. There is no assumption of the digital information to be processed before processing. An universal coder is invented and now pigeonhole meets blackhole.

The present invention aims to encode and decode a sequence of integer values by substantially assigning the number of bits of a decimal fraction value per sample. An integer converter 11 selects M selected integer values from L input integer values for a set of the L input integer values and obtains J-value selection information that specifies which of the L input integer values the M selected integer values are. Furthermore, the integer converter 11 obtains one converted integer value by reversibly converting the M selected integer value and an integer value corresponding to the J-value selection information. An integer encoder 12 encodes the converted integer value to obtain a code.

The information processing system includes: a processing unit that executes processing in cooperation with a memory; and a storage unit that stores a compression technology for a data volume to be applied to a Hamiltonian of the optimization problem, a compressible condition indicating whether the compression technology can be applied or not, and compression method judgment information associated with a compression format indicating a feature quantity of the Hamiltonian when the Hamiltonian is compressed by applying the compression technology. The processing unit: refers to the compression method judgment information and judges a part included in the Hamiltonian which satisfies the compressible condition; and extracts the feature quantity of the part, which is included in the Hamiltonian and judged as satisfying the compressible condition, by means of the compression technology corresponding to the compressible condition and compresses the extracted feature quantity into the compression format.

An amount of memory needed to hold prime data elements during reconstitution may be determined by examining the creation and usage of prime data elements and their spatial and temporal characteristics during data distillation.

A computer-implemented method of data compression leveraging quantum computing and classical computing includes extracting metadata from a binary data to be compressed. The binary data is compressed by iteratively performing a compression operation including selecting a hashing function and hashing the binary data. The quantum computer device performs an inverting of the hashing function and generates a finite number of one or more resultant files associated with the hashed data. A compressed file including the hashes and the metadata used for the decompression is stored upon determining that the one or more resultant files is a single file.

Text can be encoded into DNA sequences. Each word from a document or other text sample can be encoded in a DNA sequence or DNA sequences and the DNA sequences can be stored for later retrieval. The DNA sequences can be stored digitally, or actual DNA molecules containing the sequences can be synthesized and stored. In one example, the encoding technique makes use of a polynomial function to transform words based on the Latin alphabet into k-mer DNA sequences of length k. Because the whole bits required for the DNA sequences are smaller than the actual strings of words, storing documents using DNA sequences may compress the documents relative to storing the same documents using other techniques. In at least one example, the mapping between words and DNA sequences is one-to-one and the collision ratio for the encoding is low.

A method, and the associated design, schema and techniques for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes of encryption/decryption or compression/decompression or both, including the use of Digital Lensing, Unlimited Code System, and other associated techniques. There is no assumption of or requirement for the digital information to be processed before processing.

Disclosed is a transmission device capable of reducing quantization errors in nonlinear quantization of IQ signals. In the device, a standard deviation measuring unit measures a standard deviation σ of the amplitude distribution of input signals. A kurtosis measuring unit measures the kurtosis of the amplitude distribution of the input signals. A correction coefficient determining unit determines a correction coefficient α corresponding to the kurtosis of the amplitude distribution of the input signals. A quantization unit quantizes the input signals using the correction coefficient α and calculates quantization data. A multiplexing unit multiplexes the quantization data and quantization control information with each other.