Algebraic coding techniques for data sequences defined over finite integer rings

H.K Garg,Y.K See

doi:10.1109/icics.1997.647135

Algebraic coding techniques for data sequences defined over finite integer rings

H.K Garg, Y.K See

https://doi.org/10.1109/icics.1997.647135

Copy DOI

Publication Date: Sep 9, 1997

Citations: 1

Affiliation: National University of Singapore

#Finite Integer Rings #Integer Rings + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

This work establishes the design of BCH (Bose-Chaudhary-Hoquenghem) and RS (Reed Solomon) codes for processing data sequences defined over a ring of integers {0,1...,2/sup a/-1}. The approach is to make use of the existing coding theory techniques over GF(2). The derivation of the generator polynomials over Z(2/sup a/) is based on expanding the corresponding generator polynomials defined over GF(2). The decoding procedure for the codes is also derived using the decoder over GF(2) recursively.

Full Text