By Topic

Application of GF(2p) CA in burst error correcting codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Paul, K. ; Dept. of Comput. Sci. & Technol., Deemed Univ., Howrah, India ; Chowdhury, D.R.

In this paper, a new concept of Cellular Automata (CA) in GF(2m) is introduced with its characterization based on matrix algebra. Utilizing the group properties of CA in GF(2m) a new encoding-decoding is proposed for Burst Error Control Codes(BECC). The regular and cascadable structure of GF(2m ) CA is very much suited from the VLSI design viewpoint and requires significantly less hardware compared to the existing techniques employed for Reed-Solomon code

Published in:

VLSI Design, 2000. Thirteenth International Conference on

Date of Conference:

2000