Results 121 to 130 of about 4,095 (149)
Some of the next articles are maybe not open access.
The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths
IEEE Transactions on Information Theory, 2023The 3/4 conjecture was posed 25 years ago by Ahlswede, Balkenhol, and Khachatrian, and states that if a multiset of positive integers has Kraft sum at most 3/4, then there exists a code that is both a prefix code and a suffix code with these integers as ...
Spencer Congero, K. Zeger
semanticscholar +1 more source
Polynomial-Time Construction of Two-Channel Prefix-Free Codes with Given Codeword Lengths
Information Theory Workshop, 2021Although n-channel prefix-free codes are natural extensions of their 1-channel counterpart, the extra dimensions greatly increase the complexity of the problem such that most classical results cannot be generalized directly.
Hoover H. F. Yin +4 more
semanticscholar +1 more source
Laser Physics Letters, 2023
The error correction of information reconciliation affects the performance of the continuous-variable quantum key distribution (CV-QKD). Polar codes can be strictly proven to reach the Shannon-limit.
Zhengwen Cao +3 more
semanticscholar +1 more source
The error correction of information reconciliation affects the performance of the continuous-variable quantum key distribution (CV-QKD). Polar codes can be strictly proven to reach the Shannon-limit.
Zhengwen Cao +3 more
semanticscholar +1 more source
International Symposium on Information Theory
In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most $D$ ones, where $D$ is a given input parameter.
Roberto Bruno, R. Prisco, Ugo Vaccaro
semanticscholar +1 more source
In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most $D$ ones, where $D$ is a given input parameter.
Roberto Bruno, R. Prisco, Ugo Vaccaro
semanticscholar +1 more source
Constructions and Bounds for q-Ary (1, k)-Overlap-Free Codes
IEEE Transactions on Information TheoryA $(1,k)$ -overlap-free code, motivated by applications in DNA-based data storage systems and synchronization between communication devices, is a set of words in which no prefix of length $t$ of any word is the suffix of any word for every integer $t$
Qinlin Cai, Xiaomiao Wang, Tao Feng
semanticscholar +1 more source
Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes
IEEE Transactions on Information TheoryA cross-bifix-free code of length $n$ over $\mathbb {Z}_{q}$ is a non-empty subset of $\mathbb {Z}_{q}^{n}$ such that the prefix set of each codeword is disjoint from the suffix set of every codeword.
Chunyan Qin, Bocong Chen, Gaojun Luo
semanticscholar +1 more source
Underwater Communication Using Full-Body Gestures and Optimal Variable-Length Prefix Codes
IEEE International Conference on Robotics and Automation, 2019In this paper we consider inter-robot communication in the context of joint activities. In particular, we focus on convoying and passive communication for radio-denied environments by using whole-body gestures to provide cues regarding future actions. We
Karim Koreitem +4 more
semanticscholar +1 more source
On the maximum size of variable-length non-overlapping codes
Designs, Codes and CryptographyNon-overlapping codes are a set of codewords such that any nontrivial prefix of each codeword is not a nontrivial suffix of any codeword in the set, including itself.
Geyang Wang, Qi Wang
semanticscholar +1 more source
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
SPIRE, 2016For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when we can choose the order in which codewords ...
A. Fariña +4 more
semanticscholar +1 more source
Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth
IEEE Transactions on Information TheoryWe study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes.
Duc Tu Dao, Han Mao Kiah, T. T. Nguyen
semanticscholar +1 more source