Results 21 to 30 of about 28,330 (190)
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
IEEE Access, 2019 In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known.
Ian Blanes +3 more
doaj +1 more source
Infinite anti-uniform sources [PDF]
, 2013 6 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti-uniform sources for some ...
Munteanu, Valeriu +2 more
core +5 more sources
Photon-Counting Security Tagging and Verification Using Optically Encoded QR Codes
IEEE Photonics Journal, 2014 We propose an optical security method for object authentication using photon-counting encryption implemented with phase encoded QR codes. By combining the full phase double-random-phase encryption with photon-counting imaging method and applying an ...
A. Markman, B. Javidi, M. Tehranipoor
doaj +1 more source
INFINITE ANTI - UNIFORM SOURCES WITH GEOMETRIC DISTRIBUTION [PDF]
, 2012 11 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet generated by geometric distribution. Huffman encoding of these sources results in AUH codes.
Munteanu, Valeriu +2 more
core +3 more sources
A modified approach to data hiding in Microsoft Word documents by change-tracking technique
Journal of King Saud University: Computer and Information Sciences, 2020 Steganography is a hidden way of communication, where one person communicates with the other by using some medium under the garb of a cover, without any suspicion created on the part of any unauthorized intermediary about the existence of the secret ...
Susmita Mahato +2 more
doaj +1 more source
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
A new data embedding method for mpeg layer III audio steganography [PDF]
, 2016 A new method of MP3 steganography is proposed with emphasis on increasing the steganography capacity of the carrier medium. This paper proposes a data embedding algorithm to hide more information for compressed bitstream of MP3 audio files. The sign bits
Bazyar, M., Sudirman, R.
core +2 more sources
Results in EngineeringThis research presents the transfer of multibit symbol characters and large data symbols, which pose challenges in data transfer and reception due to complexity and memory constraints.
Erna Guguloth +4 more
doaj +1 more source
IEEE Access, 2020 This paper provides a novel method to improve the data storage of a quick response code (QR code) by applying encrypted lossless compression technology. QR codes are used in several domains, particularly when there is a need to transfer various types of ...
Ammar Mohammed Ali, Alaa Kadhim Farhan
doaj +1 more source
Space-efficient Huffman codes revisited
Information Processing Letters, 2023 Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time. It uses $σ\lg \ell_{\text{max}} + o(σ) + O(\ell_{\text{
Szymon Grabowski, Dominik Köppl
openaire +3 more sources