Algorithms for computing parameters of graph-based extensions of BCH codes.
Andrei V. KelarevPublished in: J. Discrete Algorithms (2007)
Keyphrases
- computational complexity
- graph theory
- theoretical analysis
- computationally efficient
- learning algorithm
- computational cost
- significant improvement
- parameter estimation
- machine learning algorithms
- times faster
- parameter settings
- worst case
- maximum likelihood
- particle swarm optimization
- benchmark datasets
- computational efficiency
- error correcting codes