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