Results 11 to 20 of about 211 (203)
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
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
Discovering Sequential Source Code Patterns in Software Engineering
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2022 Discovering sequential patterns in source codes is an important issue in software engineering since it can provide useful knowledge to help in a variety of tasks such as code completion, code refactoring, developer profiling, and code complexity ...
Dilara Kırnapcı, Kökten Birant
doaj +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
Optimal Prefix Free Codes with Partial Sorting
Algorithms, 2019 We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O ( n ( 1 + lg α ) ) ⊆ O ( n lg n ) , where the alternation α ∈ [ 1 . .
Jérémy Barbay
doaj +1 more source
Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding
Entropy, 2021 In this paper, we study the entropy functions on extreme rays of the polymatroidal region which contain a matroid, i.e., matroidal entropy functions. We introduce variable strength orthogonal arrays indexed by a connected matroid M and positive integer v
Qi Chen, Minquan Cheng, Baoming Bai
doaj +1 more source
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
Linguistic Analysis of the Holy Defense Poems [PDF]
Literary Arts, 2023 Poetry is a form of artistic expression that utilizes language to convey thoughts and imagination. The Holy Defense poetry, in addition to its unique content, exhibits novel manifestations of the Persian language.
yousef karamicheme +2 more
doaj +1 more source
Optimum Extendible Prefix Codes
J. Univers. Comput. Sci., 1997 JUCS - Journal of Universal Computer Science Volume Nr.
Calude,Cristian, Tomescu,Ioan
openaire +2 more sources