Abstract: Mechanisms are disclosed for performing efficient lossless encryption and decryption to reduce power consumption and improve the efficiency of processing streams of digital data. An input data stream associated with a stream of input data is received. A discrete wavelet transform is applied to a first serial input data value in the input data stream. Distributed components of the first serial input data value are distributed by computing a cumulative probability that the first serial input data value is less than or equal to a power-of-two range value associated with a power-of-two probability distribution function. An entropy encoded encryption value is computed based on a range variant asymmetrical numeral system based on the power-of-two probability distribution function. The entropy encoded encryption value is unloaded based on one or more computed next states. Compressed serial output data streams are compressed based on the unloaded entropy encoded encryption value.

Abstract: Mechanisms are disclosed for performing efficient lossless encryption and decryption to reduce power consumption and improve the efficiency of processing streams of digital data. An input data stream associated with a stream of input data is received. A discrete wavelet transform is applied to a first serial input data value in the input data stream. Distributed components of the first serial input data value are distributed by computing a cumulative probability that the first serial input data value is less than or equal to a power-of-two range value associated with a power-of-two probability distribution function. An entropy encoded encryption value is computed based on a range variant asymmetrical numeral system based on the power-of-two probability distribution function. The entropy encoded encryption value is unloaded based on one or more computed next states. Compressed serial output data streams are compressed based on the unloaded entropy encoded encryption value.

Abstract: Methods and systems are disclosed for decoding codewords, wherein codewords comprise at least one circulant and are stored in a first dimension of a matrix, and wherein each circulant in a codeword is associated with a location in a second dimension in the matrix. The method includes determining whether a first location in a second dimension of a first circulant of a first codeword corresponds to a second location in the second dimension of a second circulant of a second codeword. The method includes, in response to determining that the first location does not correspond to the second location, decoding the first and second circulant with a first decoding process. The method includes, in response to determining that the first location corresponds to the second location, decoding the first and second circulant with a second decoding process.