More Optimal Quasi Complementary Sequence Sets From Florentine Rectangles

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. In this paper, we revisit the connection between $(n,k)$ sequences and Florentine rectangles, and design optimal QCSS, based on those Florentine rectangles.