Results 41 to 50 of about 2,145 (185)
Huffman Coding with Non-sorted Frequencies [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shmuel T. Klein, Dana Shapira
openaire +2 more sources
Endohedral fullerenes as qubits: From synthesis to quantum computing applications
Endohedral fullerenes emerge as promising platforms for qubits and qudits. This review surveys the primary synthesis routes, from arc‐discharge to high‐yield molecular surgery. It then details spin manipulation and readout in key systems, including metal‐based, cluster, and nitrogen‐containing fullerenes.
Jeong‐Seok Nam +11 more
wiley +1 more source
Lossless Compression of Aldebaran-I Telemetry Data Using the On+ Algorithm
Lossless compression of telemetry data in satellites is essential due to the stringent limitations of bandwidth and onboard storage. Traditional methods based on information theory and entropy coding, such as Huffman and Arithmetic coding, exploit ...
Flávio Barros +6 more
doaj +1 more source
The relationship between equatorial wave interaction and heavy rainfall in Southeast Asia
This study examines the statistical relationship between co‐occurring equatorial waves and heavy rainfall in Southeast Asia. Heavy rainfall is more closely related to combined wave activity than to individual waves in many regions of Southeast Asia. The figure shows GPM–IMERG rainfall (shading) and ERA5 850‐hPa winds (vectors) composited on days when ...
Samantha Ferrett +7 more
wiley +1 more source
Reversible data hiding in encrypted images with multi-prediction and adaptive huffman encoding
With the rapid development of multimedia technology and the massive accumulation of user data, a huge amount of data is rapidly generated and shared over the network, while the problems of inappropriate data access and abuse persist.
Hua Ren +4 more
doaj +1 more source
The Renyi redundancy of generalized Huffman codes [PDF]
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes ...
Blumer, Anselm C., McEliece, Robert J.
openaire +3 more sources
Abstract Data is the key element that runs the modern society. Large amounts of data are being released day by day as a result of many activities. The digital data is transferred through the Internet which may be vulnerable to attacks while transmitting. Especially, the medical data is observed to be of at most importance.
Rupa Ch +4 more
wiley +1 more source
High-Speed Architecture for Hybrid Arithmetic–Huffman Data Compression
This paper proposes a hardware–software co-design for adaptive lossless compression based on Hybrid Arithmetic–Huffman Coding, a table-driven approximation of arithmetic coding that preserves near-optimal compression efficiency while eliminating the ...
Yair Wiseman
doaj +1 more source
Investment centre manager's multiperiod fairness perceptions and intertemporal dependency
Abstract This paper explores the motivation of investment centre managers when their investment centre's performance is affected by decisions made by their predecessor. Through a qualitative case study of a Japanese manufacturer, the effectiveness of conventional remedies for motivational issues and further motivational issues caused by the same ...
Hiroyuki Selmes‐Suzuki
wiley +1 more source
Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann +2 more
wiley +1 more source

