Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes.
Ming JiaAnader Benyamin-SeeyarTho Le-NgocPublished in: IEEE Trans. Inf. Theory (1992)
Keyphrases
- lower bound
- error correction
- error correcting
- upper bound
- error control
- exact solution
- branch and bound
- branch and bound algorithm
- post processing
- quadratic assignment problem
- exact and approximate
- optimal solution
- multi step
- np hard
- objective function
- vc dimension
- sample complexity
- lower bounding
- error correcting codes