Conventional Reed-Solomon Codes Research Articles

Write Modeling and Read Signal Processing for Heat-Assisted Bit-Patterned Media Recording

Heat-assisted bit-patterned media recording (HABPMR) can significantly improve channel areal density due to the increased effective write field gradient provided by heat assistance and decreased media jitter offered by bit-patterned media. In this paper, an analytical write channel model, which can accurately capture the effects of Curie temperature, magnetic island position and size, anisotropy field, and write clock frequency fluctuations, is introduced and investigated for HABPMR. For read signal processing study, a read channel characterizing the media noise and reader geometry is combined with a data-dependent write channel to obtain the readback signal. In addition, the allowable write window offsets, write error rate during the write process and the bit error rate after readback as function of various noise sources are studied. Furthermore, 2-D equalization followed by the Bahl-Cocke-Jelenik-Raviv detector combined with picket-shift code is used to mitigate the 2-D interference and correct the burst errors caused by the write clock mis-synchronization. It is shown, via numerical experiments, that the proposed approach can provide significant symbol error rate performance improvement compared to a channel with conventional Reed Solomon code.

Construction of Improved Geometric Goppa Codes from Klein Curves and Klein-like Curves

Linear error-correcting codes, especially Reed-Solomon codes, find applications in communication and computer memory systems, to enhance their reliability and data integrity. In this paper, we present Improved Geometric Goppa (IGG) codes, a new class of error-correcting codes, based on the principles of algebraic-geometry. We also give a reasonably low complexity procedure for the construction of these IGG codes from Klein curves and Klein-like curves, in plane and high-dimensional spaces. These codes have good code parameters like minimum distance rate and information rate, and have the potential to replace the conventional Reed-Solomon codes in most practical applications. Based on the approach discussed in this paper, it might be possible to construct a class of codes whose performance exceeds the Gilbert-Varshamov bound.