Results 71 to 80 of about 31,581 (252)
VLSI implementation of huffman design using FPGA with a comprehensive analysis of power restrictions [PDF]
, 2015 Lossless compression is important in Information hypothesis as well as today's IT field. Lossless design of Huffman is most to a large degree used in the compression arena.
Khmag, Asem +3 more
core
Joint Source-Channel Decoding of Polar Codes for Language-Based Source
, 2016 We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after every few bits ...
Bandic, Zvonimir +4 more
core +1 more source
Chatting Towards Inclusivity: A Digital Approach to Inclusion Action Plans and Leader Development
Human Resource Management, Volume 65, Issue 2, Page 605-630, March/April 2026.ABSTRACT Inclusion is a cornerstone of success for organizations and society, yet inclusion is not guaranteed. Building on inclusive leadership research and relational models theory, we argue that inclusion cannot manifest without systematic effort and planning by leaders.
Vindhya Singh +4 more
wiley +1 more source
Real-time transmission of digital video using variable-length coding [PDF]
Huffman coding is a variable-length lossless compression technique where data with a high probability of occurrence is represented with short codewords, while 'not-so-likely' data is assigned longer codewords.
Bizon, Thomas P. +2 more
core +1 more source
A simple lossy audio coding scheme based on the DWT [PDF]
, 2007 This paper proposes a simple scheme for audio coding that does not use perceptual models. The audio coder is based on the discrete wavelet transform to decorrelate signals, computed through the lifting scheme, and followed by Huffman coding.
Khevariya, Prashant K. +2 more
core
Source Coding for Quasiarithmetic Penalties
, 2006 Huffman coding finds a prefix code that minimizes mean codeword length for a given probability distribution over a finite number of items. Campbell generalized the Huffman problem to a family of problems in which the goal is to minimize not mean codeword
Baer, Michael B.
core +4 more sources
Beyond the Lab: Cognitive Neuroscience in Real‐World Contexts
WIREs Cognitive Science, Volume 17, Issue 2, March/April 2026.Cognitive neuroscience often assumes that using laboratory animals, model species, and digital simulations enables generalizations from lab to wild, from animals to humans, and from virtual to physical. We challenge these assumptions and call for refining ecological validity along three dimensions: subject phenotype, task naturalness, and environmental
Stephan P. Kaufhold +3 more
wiley +1 more source
Lossless Compression and Data Transformation Techniques on QR Code Binary Bit Stream
IEEE AccessThis paper presents a dataset-level evaluation of six lossless compression and data transformation techniques applied to visual-cryptographic (VC) shares derived from QR codes.
Fatoumatta Conteh +5 more
doaj +1 more source
Assignment on Filters, Source Coding and Channel Coding [PDF]
Considers bandpass filters, Huffman coding, arithmetic coding and Hamming ...
Maunder, Rob
core
The Rényi Redundancy of Generalized Huffman Codes [PDF]
, 1988 Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy.
Blumer, Anselm C., McEliece, Robert J.
core