Ordered covering arrays and upper bounds on covering codes
Sign Up to like & getrecommendations! Published in 2022 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21882
Abstract: This work shows several direct and recursive constructions of ordered covering arrays (OCAs) using projection, fusion, column augmentation, derivation, concatenation, and Cartesian product. Upper bounds on covering codes in Niederreiter–Rosenbloom–Tsfasman (shorten by NRT) spaces are… read more here.
Keywords: upper bounds; ordered covering; bounds covering; covering codes ... See more keywords
On Nearly Perfect Covering Codes
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2025.3528303
Abstract: Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is… read more here.
Keywords: covering codes; bound; nearly perfect; perfect covering ... See more keywords