Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances.
Minjia ShiShitao LiTor HellesethJon-Lark KimPublished in: CoRR (2023)
Keyphrases
- worst case
- constant factor
- upper bound
- dynamic programming
- maximum distance
- hamming distance
- lower bound
- binary codes
- optimal strategy
- logical operations
- regret bounds
- minimum distance
- minimum cost
- optimal control
- error bounds
- optimal design
- non binary
- data sets
- error correcting
- error correction
- gray code
- optimal solution