Results 11 to 20 of about 16,644 (310)
Determining the Upper-Bound on the Code Distance of Quantum Stabilizer Codes Through the Monte Carlo Method Based on Fully Decoupled Belief Propagation [PDF]
EntropyThe code distance is a critical parameter of quantum stabilizer codes (QSCs), and determining it—whether exactly or approximately—is known to be an NP-complete problem.
Zhipeng Liang +4 more
doaj +2 more sources
Refinements and Generalizations of the Shannon Lower Bound via Extensions of the Kraft Inequality [PDF]
EntropyWe derive a few extended versions of the Kraft inequality for lossy compression, which pave the way to the derivation of several refinements and extensions of the well-known Shannon lower bound in a variety of instances of rate-distortion coding.
Neri Merhav
doaj +2 more sources
Refinement of the Random Coding Bound [PDF]
IEEE Transactions on Information Theory, 2014 An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $ε>0$ a pre-factor of $O(N^{-\frac{1}{2}\left( 1 - ε+ \barρ^\ast_R \right)})$ (resp.
Altuğ, Yücel, Wagner, Aaron B.
openaire +4 more sources
A bound on Grassmannian codes [PDF]
2006 IEEE International Symposium on Information Theory, 2006 We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
Alexander Barg, Dmitry Yu. Nogin
openaire +2 more sources
Моделирование и анализ информационных систем, 2022 Line codes are widely used to protect against errors in data transmission and storage systems, to ensure the stability of various cryptographic algorithms and protocols, to protect hidden information from errors in a stegocontainer. One of the classes of
Yury V. Kosolapov +2 more
doaj +1 more source
EURASIP Journal on Wireless Communications and Networking, 2021 Multi-kernel polar codes have recently received considerable attention since they can provide more flexible code lengths than do the original ones. The construction process of them can be simplified by obtaining the Bhattacharyya parameter bounds of the ...
Tikui Zhang, Sensen Li, Bin Yu
doaj +1 more source
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
InPrime, 2022 This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +1 more source
New Bounds for Frameproof Codes [PDF]
IEEE Transactions on Information Theory, 2017 Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size $q$. The upper bound is based on a combinatorial approach and the lower bound is based on a probabilistic construction.
Chong Shangguan +3 more
openaire +2 more sources
New Bounds on 2-Frameproof Codes of Length 4
International Journal of Mathematics and Mathematical Sciences, 2020 Frameproof codes were first introduced by Boneh and Shaw in 1998 in the context of digital fingerprinting to protect copyrighted materials. These digital fingerprints are generally denoted as codewords in Qn, where Q is an alphabet of size q and n is a ...
Penying Rochanakul
doaj +1 more source
Simple channel coding bounds [PDF]
2009 IEEE International Symposium on Information Theory, 2009 Presented at ISIT ...
Ligong Wang 0002 +2 more
openaire +2 more sources