رسائل ماجيستير
English
1995
Runlength limited codes with error correction capabilities
Gerhard F Bechoff, Sajid Hussain
كلية الهندسة-جامعة الملك فهد للبترول والمعادن · السعودية
Runlength limited codes with error correction capabilities are investigated. For all storage devices there are some constraints on the runlengths of the data. We proposed an algorithm for binary extension fields which modify the codewords in such a way that runlength constraints are also satisfied. This modification preserves the error correction capability of the code. And thus we obtain extra benefit that runlength constraints are also satisfied in addition to error correction. In transparent codes the compliment of every codeword is also a valid codeword. These transparent codes may give rise to infinite runlenghts. Many known codes are found to be transparent. Some general properties of these transparent codes were investigated. Weight distribution of subclass of codes proposed by Popplewell and O'Reilly were also obtained.