DocumentCode :
1536558
Title :
Some construction methods for error-correcting (d,k) codes
Author :
Nasiri-Kenari, Masoumeh ; Rushforth, C.K.
Author_Institution :
Dept. of Electr. Eng., Utah Univ., Salt Lake City, UT, USA
Volume :
42
Issue :
234
fYear :
1994
Firstpage :
958
Lastpage :
965
Abstract :
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
Keywords :
Computational complexity; Convolutional codes; Design methodology; Error correction codes; Hamming distance; Merging; Modulation coding; Optical recording; Protection; Reed-Solomon codes;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.1994.580204
Filename :
580204
Link To Document :
بازگشت