By Topic

Mean-square-error optimum coset leaders for group 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

2 Author(s)

Crimmins et al. [1] showed how to minimize mean-square error over all 1 - 1 mappings of digital data into binary group code elements when the a priori probability of the data is uniform. This paper shows how to optimize simultaneously over all possible choices of coset leaders for the detection scheme.

Published in:

Information Theory, IEEE Transactions on  (Volume:16 ,  Issue: 4 )