Skip to content
Research Article Open access CC BY 3.0

Construction Techniques of Generator Polynomials of BCH Codes

T. Shah, A. Qamar, A. A. Andrade

Current Journal of Applied Science and Technology · pp. 929–944 · Published 27 Dec 2013

10.9734/BJAST/2014/6089

Abstract

LetA0⊂A1⊂···⊂At−1⊂Atbe a chain of unitary commutative rings (eachAiis constructed bythe direct product of suitable Galois rings with multiplicative groupA∗iof units) andK0⊂K1⊂···⊂Kt−1⊂Ktbe the corresponding chain of unitary commutative rings (eachKiis constructed by thedirect product of corresponding residue fields of given Galois rings, with multiplicative groupsK∗iofunits), wheretis a non negative integer. In this work presents three different types of constructionsof generator polynomials of sequences of BCH codes having entries fromA∗iandK∗ifor eachi,where0≤i≤t.

Units of a ring BCH code Galois rings

References (9)

  1. 1 Finite Rings With Identity
  2. 2 On decoding BCH codes [DOI]
  3. 3 Codes over certain rings [DOI]
  4. 4 Codes over integer residue rings [DOI]
  5. 5 On BCH codes over arbitrary integer tings (Corresp.) [DOI]
  6. 6 Codes over Zm [DOI]
  7. 7 Construction and decoding of BCH codes over finite commutative rings [DOI]
  8. 8 Codes over Zm [DOI]
  9. 9 Chain of finite rings and construction of BCH Codes [DOI]

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

1

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.