By Topic

On optimal codes for binary asymmetric channels (Corresp.)

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

1 Author(s)

Let{ v_{1}, cdots , v_{N} }be a code ofNvectors whose components consist ofmones and(n - m)zeros. The vectors are transmitted with equal probability over the asymmetric channel whose error probabilities for transmitted zeros and ones equal respectively0andp, 0 < p < 1(such channels arise in optical communication). The problem of determining for fixed values of the parametersN, n, m, pthose codes which achieve minimum error probability is studied. The problem is solved forN leq 3. Partial results are obtained for allN.

Published in:

Information Theory, IEEE Transactions on  (Volume:32 ,  Issue: 5 )