Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)

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

Published in:

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