Results 11 to 20 of about 1,245 (171)

A Characterization of Optimal Prefix Codes [PDF]

Entropy
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
Spencer Congero, Kenneth Zeger
doaj   +2 more sources

Multi-Party Controlled Semi-Quantum Dialogue Protocol Based on Hyperentangled Bell States [PDF]

Entropy
To solve the fundamental problem of excessive consumption of classical resources and the simultaneous security vulnerabilities in semi-quantum dialogue systems, a multi-party controlled semi-quantum dialogue protocol based on hyperentangled Bell states ...
Meng-Na Zhao, Ri-Gui Zhou, Yun-Hao Feng
doaj   +2 more sources

Approximating Huffman Codes in Parallel

Journal of Discrete Algorithms, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Berman, Marek Karpinski, Yakov Nekrich   +2 more
openaire   +3 more sources

DDQR (dynamic DNA QR coding): An efficient algorithm to represent DNA barcode sequences.

PLoS ONE, 2023
A DNA barcode is a short piece of standard DNA sequence used for species determination and discrimination. Representation of DNA barcodes is essential for DNA barcodes' applications in the transportation and recognition of biological materials ...
Yujun Wang, Xinjing Yao, Rui Liu, Chang Liu   +3 more
doaj   +1 more source

2-D Bi-Level Block Coding for Color Image Compression and Transmission With Bit-Error Awareness

IEEE Access, 2020
In this paper, we develop a new color image lossless compression algorithm with bit-error awareness based on a general bi-level block coding method. The proposed method contains three stages.
Xuan Peng, Jean Jiang, Lizhe Tan, Jintao Hou   +3 more
doaj   +1 more source

Compressed Matching in Dictionaries

Algorithms, 2011
The problem of compressed pattern matching, which has recently been treated in many papers dealing with free text, is extended to structured files, specifically to dictionaries, which appear in any full-text retrieval system.
Shmuel T. Klein, Dana Shapira
doaj   +1 more source

A quantum analog of Huffman coding [PDF]

IEEE Transactions on Information Theory, 2000
Revised version, 7 pages, two-column, RevTex.
Samuel L. Braunstein, Christopher A. Fuchs, Daniel Gottesman, Hoi-Kwong Lo   +3 more
openaire   +4 more sources

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, Miguel Hernandez-Cabronero, Joan Serra-Sagrista, Michael W. Marcellin   +3 more
doaj   +1 more source

Construction of Multi-State Capacity-Approaching Variable-Length Constrained Sequence Codes With State-Independent Decoding

IEEE Access, 2019
We consider the construction of capacity-approaching variable-length constrained sequence codes based on the multi-state encoders that permit state-independent decoding. Based on the finite-state machine description of the constraint, we first select the
Congzhe Cao, Ivan Fair
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