Yayınlanmış 1 Ocak 2012 | Sürüm v1
Konferans bildirisi Açık

Cellular Automata Based Byte Error Correcting Codes over Finite Fields

  • 1. Yildiz Tech Univ, Dept Math, TR-34210 Istanbul, Turkey
  • 2. Zirve Univ, Fac Educ, Dept Math, TR-27260 Gaziantep, Turkey

Açıklama

Reed-Solomon codes are very convenient for burst error correction which occurs frequently in applications, but as the number of errors increase, the circuit structure of implementing Reed-Solomon codes becomes very complex. An alternative solution to this problem is the modular and regular structure of cellular automata which can be constructed with VLSI economically. Therefore, in recent years, cellular automata have became an important tool for error correcting codes. For the first time, cellular automata based byte error correcting codes analogous to extended Reed-Solomon codes over binary fields was studied by Chowdhury et al. [1] and Bhaumik et al. [2] improved the coding-decoding scheme. In this study cellular automata based double-byte error correcting codes are generalized from binary fields to primitive finite fields Z(p).

Dosyalar

bib-74bb16f2-84f1-43aa-85ac-fe823ed887c4.txt

Dosyalar (192 Bytes)

Ad Boyut Hepisini indir
md5:81a5305473f6e0e3d68393c8467674bf
192 Bytes Ön İzleme İndir