Block Markov superposition transmission (BMST) codes provide a flexible framework for constructing codes with near-capacity performance and low-complexity sliding-window decoding. However, existing BMST variants show contrasting performance limitations: recursive BMST (rBMST) codes suffer from error propagation but avoid high error floors, whereas non-recursive BMST codes exhibit the opposite behavior. Motivated by these complementary characteristics, we combine recursive and non-recursive components through parallel and serial concatenation, yielding mixed BMST (mBMST) codes. The proposed framework subsumes existing BMST variants and enables new BMST structures. Simulations show that these structures improve FER and BER performance with lower memory requirements than rBMST.

翻译：块马尔可夫叠加传输（BMST）码为构建具有近容量性能与低复杂度滑动窗译码的编码方案提供了灵活框架。然而，现有BMST变体呈现出对比性的性能局限：递归BMST（rBMST）码虽避免高错误平层但存在误差传播问题，而非递归BMST码则表现出相反特性。受这些互补特性的启发，我们通过并联与串联级联方式整合递归与非递归组件，从而提出混合BMST（mBMST）码。所提出的框架不仅涵盖现有BMST变体，还支持构建新型BMST结构。仿真结果表明，与rBMST相比，这些结构能以更低的内存需求改善误帧率与误比特率性能。