Results 81 to 90 of about 2,705,238 (250)
Probability updating-based adaptive hybrid coding
Tongxin xuebao, 2008 A probability updating mechanism was proposed for entropy coding. To achieve the best coding efficiency,probability updating based huffman code and structured code were jointly used,and the best context model was selected according as the correlation of ...
doaj +2 more sources
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
Pemampatan Tata Teks Berbahasa Indonesia Dengan Metode Huffman Menggunakan Panjang Simbol Bervariasi [PDF]
, 2015 Pemampatan data merupakan salah satu upaya untuk memperbesar ruang penyimpanan agar data lebih banyak yang dapat tersimpan atau untuk mempercepat suatu proses pengiriman data.
Adharul Muttaqin, S.T., M.T., Tri Yoga Septianto., Waru Djuriatno, S.T., M.T
core
D-ary Bounded-Length Huffman Coding [PDF]
2007 IEEE International Symposium on Information Theory, 2007 Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, in which codes are restricted to the set of codes in which none of the ...
openaire +2 more sources
Validating Dental Histology for Perinatal Age Estimation Using Human Deciduous Teeth
American Journal of Biological Anthropology, Volume 189, Issue 3, March 2026.ABSTRACT Objectives This study tests the accuracy of dental histology for perinatal age estimation using deciduous teeth from modern human infants of known age. We evaluate whether enamel and dentin incremental structures, particularly the Neonatal Line (NNL), can be used to provide a reliable estimate of chronological age.
Ani Martirosyan +5 more
wiley +1 more source
On the optimality of code options for a universal noiseless coder [PDF]
A universal noiseless coding structure was developed that provides efficient performance over an extremely broad range of source entropy. This is accomplished by adaptively selecting the best of several easily implemented variable length coding ...
Miller, Warner +2 more
core +1 more source
FINANCIAL PLANNING REVIEW, Volume 9, Issue 1, March 2026.ABSTRACT This study investigates the relationships between individual preferences, personality traits, abilities, and multiple indicators of financial well‐being (FWB). Employing survey data from the Understanding America Study (UAS), we analyze FWB across its different dimensions, including a composite scale, single‐item perceptions of FWB, objective ...
Jennifer Coats, Vickie Bajtelsmit
wiley +1 more source
An Enhanced Adaptive Block Truncation Coding with Edge Quantization Scheme
Applied Sciences, 2020 Recently, image compression using adaptive block truncation coding based on edge quantization (ABTC-EQ) was proposed by Mathews and Nair. Their approach deals with an image for two types of blocks, edge blocks and non-edge blocks.
Ching-Nung Yang +3 more
doaj +1 more source
Maximal codeword lengths in Huffman codes [PDF]
The following question about Huffman coding, which is an important technique for compressing data from a discrete source, is considered. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be?
Abu-Mostafa, Y. S., Mceliece, R. J.
core +1 more source
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