An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform.
Paskal PiperkovIliya BouyuklievStefka BouyuklievaPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- times faster
- high accuracy
- computational complexity
- similarity measure
- significant improvement
- dynamic programming
- matching algorithm
- detection algorithm
- theoretical analysis
- recursive least squares
- linear complexity
- optimization algorithm
- computational cost
- k means
- search space
- input data
- expectation maximization
- worst case
- probabilistic model
- experimental evaluation
- closed form
- recognition algorithm
- improved algorithm
- hardware implementation
- bayesian networks