Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound.
Leonid A. BassalygoVictor A. ZinovievVladimir S. LebedevPublished in: Probl. Inf. Transm. (2022)
Keyphrases
- non binary
- decoding algorithm
- constraint satisfaction problems
- block codes
- upper bound
- error correction
- lower bound
- frequent pattern mining
- mining high utility itemsets
- arc consistency
- worst case
- error correcting
- constraint satisfaction
- generative model
- multi dimensional
- helmholtz principle
- computational complexity