By Topic

Difference set codes: codes with squared Euclidean distance of six for partial response channels

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)
Abdel-Ghaffar, K.A.S. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; Ytrehus, O.

We present a new construction of block codes for the (1-D)-PR (partial response) channel. The codewords in the code correspond to constant-sum subsets of a difference set. It is shown that at the output of a noiseless (1-D)-PR channel; the minimum squared Euclidean distance of such a code is at least six, compared to two for the uncoded system. This construction yields larger code rates than previously known codes with the same minimum distance for large code lengths. The construction technique also imposes upper bounds on the decoding complexity of the codes

Published in:

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