Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes.
Sergei V. BezzateevNatalia A. ShekhunovaPublished in: IEEE Trans. Inf. Theory (2018)
Keyphrases
- non binary
- lower bound
- decoding algorithm
- constraint satisfaction problems
- upper bound
- branch and bound
- binary representation
- np hard
- branch and bound algorithm
- arc consistency
- optimal solution
- frequent pattern mining
- objective function
- constraint satisfaction
- worst case
- error correction
- graphical models
- knowledge discovery