By Topic

Some construction methods for error-correcting (d,k) 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)
Nasiri-Kenari, M. ; Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA ; Rushforth, C.K.

Considers three methods for constructing (d,k) codes with guaranteed error-correcting capability. All three methods begin with state-dependent modulation codes to satisfy the (d,k) constraints. The first is an ad hoc method that uses the state-splitting procedure of Adler et al. (1983), together with additional constraints to ensure that the required minimum distance is achieved. The second method partitions the state-dependent modulation code into a part with memory and a part without, and then combines the part with memory with a matched convolutional code to provide error protection. The third method is obtained by modifying of the procedure of Lee and Wolf (1989) to accommodate state-dependent modulation codes. All three methods have yielded codes whose rates, computational complexities, and error-correcting capabilities compare favorably with codes designed using other methods

Published in:

Communications, IEEE Transactions on  (Volume:42 ,  Issue: 234 )