Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Encoding and decoding for the minimization of message symbol error rates in linear block 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

1 Author(s)

Given any fixed linear block code, the error rates for the message symbols depend both on the encoding function and on the decoding map. This research shows how to optimize the choice of a generator matrix and decoding map simultaneously to minimize the error rates for all message symbols. The model used assumes that the distribution of messages is flat and that the distribution of error vectors defining the channel is independent of the message transmitted. In addition, it is shown that, with proper choice of coset leaders, standard array decoding is optimal in this circumstance. The results generalize previously known results on unequal error protection and are sufficiently general to apply when a code is used for error detection only.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 1 )