Results 251 to 260 of about 223,530 (281)
Some of the next articles are maybe not open access.
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
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
1992
Abstract In Parts 1 and 3 we have constructed codes that are designed to give a certain worst case performance. For such codes Shannon’s theorem is not an appropriate measure because it concerns the average performance of a code. In this chapter we shall prove some simple bounds on the worst-case performance of codes and compare our ...
openaire +1 more source
Abstract In Parts 1 and 3 we have constructed codes that are designed to give a certain worst case performance. For such codes Shannon’s theorem is not an appropriate measure because it concerns the average performance of a code. In this chapter we shall prove some simple bounds on the worst-case performance of codes and compare our ...
openaire +1 more source
1999
We have already explained that a good code should have large d/n andk/nin the unit interval [0,1] for a givenn.From Shannon’s theorem we know also that we should study long codes. However, if the channel has symbol-error probabilitypthen we should expect an average ofpnerrors per received word of lengthn.To correct these we need to have a minimum ...
openaire +1 more source
We have already explained that a good code should have large d/n andk/nin the unit interval [0,1] for a givenn.From Shannon’s theorem we know also that we should study long codes. However, if the channel has symbol-error probabilitypthen we should expect an average ofpnerrors per received word of lengthn.To correct these we need to have a minimum ...
openaire +1 more source
The Order Bound for Toric Codes
2009In this paper we investigate the minimum distance of generalized toric codes using an order bound like approach. We apply this technique to a family of codes that includes the Joyner code. For some codes in this family we are able to determine the exact minimum distance.
Peter Beelen, Diego Ruano
openaire +1 more source
Bounds on Communication with Polyphase Coding
Bell System Technical Journal, 1966The theoretical capabilities of a “polyphase” coding-modulation scheme with additive white Gaussian noise are studied. The channel capacity of this system is found and the error exponent estimated. Bounds are also found on R o (ρ max ), the maximum (asymptotic) rate for which polyphase codes can be found with maximum correlation between code words ρ ...
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
Singleton's Bound in Euclidean Codes
Algebra Colloquium, 2010There are three standard weight functions on a linear code viz. the Hamming weight, Lee weight and Euclidean weight. The Euclidean weight function is useful in connection with the lattice constructions, where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code.
openaire +1 more source
Asymptotic bounds on frameproof codes
IEEE Transactions on Information Theory, 2002Chaoping Xing
exaly
Bounds for projective codes from semidefinite programming
Advances in Mathematics of Communications, 2013Christine Bachoc, Frank Vallentin
exaly