Results 271 to 280 of about 16,644 (310)
Some of the next articles are maybe not open access.
Bounds on the Identifying Codes in Trees
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadi Rahbani +2 more
openaire +2 more sources
On a Fallacious Bound for Authentication Codes
Journal of Cryptology, 1999An authentication code provides a way to transmit information over an insecure channel. A possible attack by an opponent is to try to deceive the receiver by replacing the legitimate message by a different one, hoping the receiver will accept it as valid. For this so-called substitution attack one can compute the probability of success.
BLUNDO, Carlo +3 more
openaire +3 more sources
IEEE Transactions on Information Theory, 1992
Summary: A divisible code is a linear code whose word weights have a common divisor larger than one. If the divisor is a power of the field characteristic, there is a simple bound on the dimension of the code in terms of its weight range. When this bound is applied to the subcode of words with weight divisible by four in a type I binary self-dual code,
openaire +2 more sources
Summary: A divisible code is a linear code whose word weights have a common divisor larger than one. If the divisor is a power of the field characteristic, there is a simple bound on the dimension of the code in terms of its weight range. When this bound is applied to the subcode of words with weight divisible by four in a type I binary self-dual code,
openaire +2 more sources
Improved Bounds for Separable Codes and $B_2$ Codes
IEEE Communications Letters, 2020Separable codes and $B_{2}$ codes are combinatorial structures which could be applied to identify traitors in multimedia fingerprinting and to uniquely decode messages in multiple access communication respectively. In this letter we provide new lower and upper bounds for the largest code rates of $q$ -ary separable codes and $B_{2 ...
Yujie Gu, Jinping Fan, Ying Miao 0001
openaire +1 more source
A Bound for Error-Correcting Codes
IBM Journal of Research and Development, 1960This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and d. Values of k and d are given for which one of these bounds can actually
openaire +1 more source
Bounds for Codes in the Grassmann Manifold
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel, 2006Upper bounds are derived for codes in the Grassmann manifold with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and projective spaces. The new bounds are asymptotically better than the previously known ones.
Christine Bachoc +2 more
openaire +1 more source
IEEE Transactions on Information Theory, 2018
In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source–channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an acyclic discrete memoryless network, where the network
Si-Hyeon Lee, Sae-Young Chung
openaire +2 more sources
In this paper, we prove a unified achievability bound that generalizes and improves random coding bounds for any combination of source coding, channel coding, joint source–channel coding, and coding for computing problems assuming blockwise node operation. As a general network setup, we consider an acyclic discrete memoryless network, where the network
Si-Hyeon Lee, Sae-Young Chung
openaire +2 more sources
1988
In this chapter we shall be interested in codes that have as many codewords as possible, given their length and minimum distance. We shall not be interested in questions like usefulness in practice, encoding or decoding of such codes. We again consider as alphabet a set Q of q symbols and we define θ:= (q − 1)/q. Notation is as in Section 3.1.
Jacobus H. van Lint, Gerard van der Geer
openaire +1 more source
In this chapter we shall be interested in codes that have as many codewords as possible, given their length and minimum distance. We shall not be interested in questions like usefulness in practice, encoding or decoding of such codes. We again consider as alphabet a set Q of q symbols and we define θ:= (q − 1)/q. Notation is as in Section 3.1.
Jacobus H. van Lint, Gerard van der Geer
openaire +1 more source
Performance bounds for fractal coding
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002Reports on investigations concerning the performance of fractal transforms. Emerging from the structural constraints of fractal coding schemes, lower bounds for the reconstruction error are given without regarding quantization noise. This implies finding an at least locally optimal transformation matrix.
openaire +1 more source
Modified bounds for covering codes
IEEE Transactions on Information Theory, 1991The covering radius of binary codes is studied. Bounds on K(n,R), the minimum cardinality of any binary code of length n and covering radius R, are found. Modifications of the van Wee lower bounds are proved for K(n,R), the minimal number of codewords in any binary code of length n and covering radius R.
openaire +1 more source