By Topic

An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

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
$33 $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)
M. Nilsson ; Dept. of Technol., Univ. Coll. of Kalmar, Sweden ; H. Lennerstad

We present an upper bound on the minimum Euclidean distance dEmin(C) for block-coded PSK. The bound is an analytic expression depending on the alphabet size q, the block length n, and the number of codewords |C| of the code C. The bound is valid for all block codes with q⩾4 and with medium or high rate-codes where |C|>(q/3) n. There are several well-known block codes whose dEmin (C) is equal to our upper bound. Hence these codes are the best possible in the sense that there does not exist a code with the same q, n, and |C| and with a larger dEmin(C). It also follows that for many choices of q, n, and |C|, in particular for high rates, our upper bound on dEmin(C) is optimal

Published in:

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