memoryless symmetric (BMS) channel, and are observed to have a comparable
performance to that of random codes in terms of scaling laws. On the negative side, RM
codes lack efficient decoders with performance close to that of a maximum likelihood
decoder for general parameters. Also, they only admit certain discrete sets of rates. In this
paper, we focus on subcodes of RM codes with flexible rates that can take any code …