Results 281 to 290 of about 16,644 (310)

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 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

Singleton's Bound in Euclidean Codes

Algebra Colloquium, 2010
There 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

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

Asymptotic bounds on frameproof codes

IEEE Transactions on Information Theory, 2002
Chaoping Xing
exaly  

Bounds for projective codes from semidefinite programming

Advances in Mathematics of Communications, 2013
Christine Bachoc, Frank Vallentin
exaly  

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes

IEEE Transactions on Information Theory, 2018
Abhishek Agarwal, Alexander Barg, Sihuang Hu   +2 more
exaly  

Bounds and constructions for ternary constant-composition codes

IEEE Transactions on Information Theory, 2002
P R J Ostergard, Galina Bogdanova
exaly  

Some new bounds for binary multiple burst‐correcting codes

Electronics Letters, 2014
Luis Javier García Villalba, Ana Lucila Sandoval Orozco   +1 more
exaly