By Topic

On an upper bound for mixed error-correcting codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Perkins, S. ; Div. of Math. & Stat., Univ. of Glamorgan, Pontypridd, UK ; Sakhnovich, A.L. ; Smith, D.H.

A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when only two distinct alphabets are used. Numerical results are presented to show that, in various cases, two different forms of the bound and alternative choices of a parameter may give the strongest bound.

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 2 )