Results 31 to 40 of about 1,801 (211)
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
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
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
Spreading Code Design for a MC-CDMA Based GNSS Pilot Signal
, 2010 MC-CDMA can represent an alternative to classical DS-CDMA for the design of GNSS ranging signals. A first requirement MC-CDMA signals must fulfill is that their generation on a satellite payload be feasible.
Meurer, Michael +7 more
core +1 more source
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
On the redundancy achieved by Huffman codes [PDF]
Information Sciences, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto De Prisco, Alfredo De Santis
openaire +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
Sustainable Productivity Growth in Agriculture: The Role of Shifts in R&D Investments and Technology
Applied Economic Perspectives and Policy, EarlyView.ABSTRACT The objective of the paper is to evaluate the long‐term prospects of sustainable productivity growth linked to plausible assumptions on public agricultural R&D investments as the key productivity driver. Second, it investigates the role of changing R&D focus from yield maximization to input saving technologies (fertilizers and pesticides). The
Zuzana Smeets Křístková +4 more
wiley +1 more source
M-ary Anti - Uniform Huffman Codes for Infinite Sources With Geometric Distribution
, 2013 International audienceIn this paper we consider the class of generalized antiuniform Huffman (AUH) codes for sources with infinite alphabet and geometric distribution.
Zaharia, Gheorghe +5 more
core +2 more sources