Results 231 to 240 of about 13,649 (264)

Bounds on codes with few distances

2010 IEEE International Symposium on Information Theory, 2010
We prove a new bound on the size of codes with few distances in the Hamming space, improving an earlier result of P. Delsarte. We also improve the Ray-Chaudhuri-Wilson bound of the size of uniform intersecting families of subsets (constant-weight codes) and the bound of Delsarte-Goethals-Seidel on the maximum size of spherical codes with few distances.
Alexander Barg, Oleg R. Musin
openaire   +1 more source

Bounds on codes

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

The Order Bound for Toric Codes

2009
In 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 the rate of disjunctive codes

Problems of Information Transmission, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin   +3 more
openaire   +3 more sources

Bounds on Codes

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

Modified bounds for covering codes

IEEE Transactions on Information Theory, 1991
The 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

Performance bounds for fractal coding

1995 International Conference on Acoustics, Speech, and Signal Processing, 2002
Reports 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   +2 more sources

Bounds on Communication with Polyphase Coding

Bell System Technical Journal, 1966
The 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

Bounds on the redundancy of Huffman codes

IEEE Trans. Inf. Theory, 1986
New upper bounds on the redundancy of Huffman codes are provided. A bound that for \(2/9\leq P_ 1\leq 0.4\) is sharper than the bound of Gallager, when the probability of the most likely source letter \(P_ 1\) is the only known probability is presented. The improved bound is the tightest possible for \(1/3\leq P_ 1\leq 0.4\). Upper bounds are presented
Renato M. Capocelli, Raffaele Giancarlo, Inder Jeet Taneja   +2 more
openaire   +2 more sources

New performance bounds for turbo codes

IEEE Transactions on Communications, 1998
T M Duman
exaly