Results 11 to 20 of about 11,062 (250)
On the Maximum Size of a Prefix Code
IEEE Transactions on Information Theory, 2022 <div>In this paper, we investigate the maximum size of a minimal dictionary of a binary prefix-code string. We develop exact formulas for the maximum number of codewords of a minimal dictionary, which belongs to a binary string of some length. Further, we elaborate on the computational complexity of our approach and its relation to the Lambert ...
Peter Horák +2 more
openaire +1 more source
A Quaternary Code Correcting a Burst of at Most Two Deletion or Insertion Errors in DNA Storage
Entropy, 2021 Due to the properties of DNA data storage, the errors that occur in DNA strands make error correction an important and challenging task. In this paper, a new code design of quaternary code suitable for DNA storage is proposed to correct at most two ...
Thi-Huong Khuat, Sunghwan Kim
doaj +1 more source
The Exact Query Complexity of Yes-No Permutation Mastermind
Games, 2020 Mastermind is famous two-player game. The first player (codemaker) chooses a secret code which the second player (codebreaker) is supposed to crack within a minimum number of code guesses (queries).
Mourad El Ouali, Volkmar Sauerland
doaj +1 more source
Hall of Mirrors: A Novel Strategy to Address Locality in Geocoded-Based PoI Private Queries
IEEE Access, 2022 Location privacy techniques try to protect user’s information by altering, aggregating or generalizing it. Geographical codification techniques, like Geohash, can be used to protect individual locations altering the precision of the location so it
Pedro Wightman +3 more
doaj +1 more source
Crypto-Compression Prefix Coding [PDF]
Data Compression Conference (DCC'06), 2006 Summary form only given. This paper proposes some additional strategies to prefix data compression algorithms to achieve both compressed and ciphered data with the use of a provably secure algorithm. It was shown that the use of homophonic substitution increases the security of the ciphertext and that breaking HSPC2 (homophonic substitution prefix ...
Ruy Luiz Milidiú, Claudio G. Mello
openaire +1 more source
On the lattice of prefix codes
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Restivo, Pedro V. Silva
openaire +2 more sources
Efficient decoding of prefix codes [PDF]
Communications of the ACM, 1990 A special case of the data compression problem is presented, in which a powerful encoder transmits a coded file to a decoder that has severely constrained memory. A data structure that achieves minimum storage is presented, and alternative methods that sacrifice a small amount of storage to attain faster decoding are described.
Hirschberg, Daniel S., Lelewer, Debra A.
openaire +2 more sources
3D PCDM Probabilistic Shaping Transmission Scheme Based on Chaotic Constellation Mapping
IEEE Photonics Journal, 2023 In this article, a high-security three-dimensional (3D) probabilistic shaping optical transmission system based on prefix-free code distribution matching (PCDM) and Polar code joint coding is proposed.
Mengjie Wu +13 more
doaj +1 more source
On the decomposition of prefix codes
Theoretical Computer Science, 2017 The paper deals with the decomposition of rational and maximal prefix codes. A set \(X \subset A^*\) is said to be \textit{rational} if it is accepted by a finite automaton. It is a \textit{code} if it is uniquely decodable, that is, if for all \(h,k \geq 0\) and \(c_1, c_2, \ldots, c_h, \, c_1', c_2', \ldots, c_k' \in X\) one has \[ c_1 c_2 \cdots c_h
DE FELICE, Clelia +2 more
openaire +1 more source
The Optimal Fix-Free Code for Anti-Uniform Sources
Entropy, 2015 An \(n\) symbol source which has a Huffman code with codelength vector \(L_{n}=(1,2,3,\cdots,n-2,n-1,n-1)\) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free ...
Ali Zaghian +2 more
doaj +1 more source