Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary constant subblock-composition codes (CSCCs), where each codeword is partitioned into equal sized subblocks, and …