Results 11 to 20 of about 28,330 (190)
Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation
Algorithms, 2019 Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non–prefix–free codes, where a code-word can be a prefix of other(s)
Muhammed Oğuzhan Külekci +1 more
doaj +1 more source
International journal of health sciences, 2022 In the proposed Huffman LEACH model, energy consumption increases exponentially with distance and there are no maximum limits. The transmit power level of a sensor node can only be adjusted to discrete values that may result in one transmit power level for various distances.
Sunil S. Harakannanavar +5 more
openaire +1 more source
Low-Power Lossless Data Compression for Wireless Brain Electrophysiology
Sensors, 2022 Wireless electrophysiology opens important possibilities for neuroscience, especially for recording brain activity in more natural contexts, where exploration and interaction are not restricted by the usual tethered devices.
Aarón Cuevas-López +4 more
doaj +1 more source
علوم رایانش و فناوری اطلاعات, 2021 All binary codes, even Huffman optimal code, are kind of non-optimal bit arrangement. Therefore, binary code optimization is a challenging problem. In this paper an algorithm is proposed to optimize the codes by converting any type of binary code to a ...
پرویز قره باقری +2 more
doaj
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 +3 more
doaj +1 more source
Approximating Huffman Codes in Parallel
Journal of Discrete Algorithms, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Berman +2 more
openaire +3 more sources
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 +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
Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis [PDF]
, 2015 For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane "canonical" trees.
Heuberger, Clemens +2 more
core +2 more sources
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