A decompression apparatus is provided. The decompression apparatus includes a memory configured to store compressed data decompressed and used in neural network processing of an artificial intelligence model, a decoder configured to include a plurality of logic circuits related to a compression method of the compressed data, decompress the compressed data through the plurality of logic circuits based on an input of the compressed data, and output the decompressed data, and a processor configured to obtain data of a neural network processible form from the data output from the decoder.

A magnetic disk device includes a magnetic disk, which includes, in a track, a plurality of first sectors each recording user data and a second sector recording parity data for restoring the user data recorded in the first sectors, and a disk controller configured to read data from a plurality of sectors including the first sectors and the second sector based on an instruction from a host, and to detect whether there is an error in each of the first sectors when the user data is read from the first sectors. The disk controller continues reading the data recorded in the plurality of sectors even when an error is detected in one of the first sectors by the disk controller.

A method and apparatus for obtaining data from a memory, estimating a probability of data values of the obtained data based on at least one of a source log-likelihood ratio and a channel log-likelihood ratio, wherein each bit in the obtained data has an associated log-likelihood ratio, determining at least one data pattern parameter for the data and performing a decoding process using the at least one data pattern parameters to determine a decoded data set.

Systems and methods are disclosed for decoding data. A first block of data may be obtained from a storage medium or received from a computing device. The first block of data includes a first codeword generated based on an error correction code. A first set of likelihood values is obtained from a neural network. The first set of likelihood values indicates probabilities that the first codeword will be decoded into one of a plurality of decoded values. A second set of likelihood values is obtained from a decoder based on the first block of data. The second set of likelihood values indicates probabilities that the first codeword will be decoded into one of the plurality of decoded values. The first codeword is decoded to obtain a decoded value based on the first set of likelihood values and the second set of likelihood values.

Efficient encoding and decoding of data for storage in polymers is provided. In various embodiments, an input file is read. The input file is segmented into a plurality of segments. A plurality of packets is generated from the plurality of segments by applying a fountain code. Each of the plurality of packets is encoded as a sequence of monomers. The sequences of monomers are screened against at least one constraint. An oligomer is outputted corresponding to each sequence that passes the screening.

A method and apparatus for obtaining data from a memory, estimating a probability of data values of the obtained data based on at least one of a source log-likelihood ratio and a channel log-likelihood ratio, wherein each bit in the obtained data has an associated log-likelihood ratio, determining at least one data pattern parameter for the data and performing a decoding process using the at least one data pattern parameters to determine a decoded data set.

The present disclosure is based on erasure coding, information dispersal, secret sharing and ramp schemes to assure reliability and security. More precisely, the present disclosure combines ramp threshold secret sharing and systematic erasure coding.

Provided is a data processing device that reduces the amount of memory access in a case where data and an error control code are to be stored in a memory. The processing device includes a data compression section, a code generation section, a binding section, and a transfer section. The data compression section generates second data by performing a predetermined compression process on first data that is to be stored in a memory and of a predetermined data length. The code generation section generates an error control code for the first data or the second data. The binding section generates third data by binding the second data generated by the data compression section to the error control code generated by the code generation section. The transfer section transfers the third data generated by the binding section to the memory in units of the predetermined data length.

Compression coding may be used with forward error correction (FEC) coding to provide higher information rates by reducing the proportion of redundant bits relative to information bits that are transmitted from a transmitter to a receiver. In one example, first determiners and second determiners are calculated from a set of information bits, where each first determiner is calculated from a different first subset of the information bits along a first dimension, and each second determiner is calculated from a different second subset of the information bits along a second dimension that differs from the first dimension. First and second nubs are calculated from the first and second determiners, respectively, each nub comprising a number of redundant bits that is less than the number of bits in the determiners from which the nub is calculated. The information bits and the nubs are transmitted over one or more communications channels.

Methods and apparatuses for HARQ in a non-terrestrial network are disclosed. An operation method of a first node may comprise receiving a transport block (TB) from a second node; classifying total soft bits for the TB into information values and sign values; configuring the information values of the total soft bits into one or more subsets; performing a compression operation on each of the one or more subsets; and performing a compression operation on the sign values. Therefore, performance of the communication system can be improved.