DocumentCode :
885922
Title :
The (d,k) subcode of a linear block code
Author :
Patapoutian, Ara ; Kumar, P. Vijay
Author_Institution :
IBM, Tucson, AZ, USA
Volume :
38
Issue :
4
fYear :
1992
fDate :
7/1/1992 12:00:00 AM
Firstpage :
1375
Lastpage :
1382
Abstract :
A simple technique employing linear block codes to construct (d,k) error-correcting block codes is considered. This scheme allows asymptotically reliable transmission at rate R over a BSC channel with capacity CBSC provided R Cd,k-(1+CBSC), where Cd,k is the maximum entropy of a (d,k ) source. For the same error-correcting capability, the loss in code rate incurred by a multiple-error correcting (d,k) code resulting from this scheme is no greater than that incurred by the parent linear block code. The single-error correcting code is asymptotically optimal. A modification allows the correction of single bit-shaft errors as well. Decoding can be accomplished using off-the-shelf decoders. A systematic (but suboptimal) encoding scheme and detailed case studies are provided
Keywords :
decoding; encoding; error correction codes; (d,k) subcode; BSC channel; asymptotically optimal; decoding; encoding scheme; error-correcting block codes; linear block code; maximum entropy; multiple-error correcting (d,k) code; single bit-shaft errors; single-error correcting code; Block codes; Computer errors; Decoding; Disk recording; Entropy; Error correction; Error correction codes; Interference constraints; Intersymbol interference; Magnetic recording;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.144720
Filename :
144720
Link To Document :
بازگشت