Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/81374
Title: Algebraic coding techniques for data sequences defined over finite integer rings
Authors: Garg, Hari K. 
See, Yew K.
Issue Date: 1997
Source: Garg, Hari K.,See, Yew K. (1997). Algebraic coding techniques for data sequences defined over finite integer rings. Proceedings of the International Conference on Information, Communications and Signal Processing, ICICS 1 : 439-443. ScholarBank@NUS Repository.
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..., 2a-1}. The approach is to make use of the existing coding theory techniques over GF(2). The derivation of the generator polynomials over Z(2a) 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.
Source Title: Proceedings of the International Conference on Information, Communications and Signal Processing, ICICS
URI: http://scholarbank.nus.edu.sg/handle/10635/81374
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

33
checked on Apr 20, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.