An Algorithm for BCH Codes Extended with Finite State Automata
Andrei V. Kelarev · FedUni ResearchOnline (Federation University Australia) · 2008
This article develops a combinatorial algorithm for a class of codes extending BCH codes and constructed with finite state automata. Our algorithm computes the largest number of errors that the extended codes can correct, and finds a generator for eachoptimal code in this class of extensions. The question of finding codes with largest possible information rates remains open.