A Fast Encoding Algorithm for BCH Codes Based on Constructing Array Table

Cyclic codes, which have been widely used in modern communication systems, can be constructed over finite fields. BCH codes are a subclass of cyclic codes with many special properties that enable efficient encoding and decoding. This paper presents an array table of natural numbers to implement enco...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2025 21st International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) S. 710 - 714
Hauptverfasser: Zhang, Huanming, Zhou, Yuexia, Xiao, Yonghao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 26.07.2025
Schlagworte:
Arrays
BCH
Codes
Digital systems
Encoding
Field Polynomial
Finite element analysis
Finite Field
Fuzzy systems
Galois fields
Generators
Knowledge discovery
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Cyclic codes, which have been widely used in modern communication systems, can be constructed over finite fields. BCH codes are a subclass of cyclic codes with many special properties that enable efficient encoding and decoding. This paper presents an array table of natural numbers to implement encoding of BCH codes through linear operations.
DOI:10.1109/ICNC-FSKD67701.2025.11198122