Lower bound of covering radius of binary irreducible Goppa codes.
Sergey BezzateevNatalia A. ShekhunovaPublished in: Des. Codes Cryptogr. (2017)
Keyphrases
- lower bound
- upper bound
- logical operations
- error correcting
- error correcting codes
- branch and bound algorithm
- np hard
- branch and bound
- objective function
- upper and lower bounds
- error correction
- binary codes
- optimal solution
- lower and upper bounds
- gray code
- neural network
- non binary
- circular arcs
- linear programming
- lagrangian relaxation
- lower bounding
- query processing
- learning algorithm