论文标题
代码本不匹配可以通过不匹配的解码完全补偿
Codebook Mismatch Can Be Fully Compensated by Mismatched Decoding
论文作者
论文摘要
我们考虑一个恒定组成代码的集合，这些组合代码是线性代码的子集：虽然编码器仅使用恒定组件子代码，但解码器的运行方式就好像使用了完整的线性代码一样，同时使同时受益于通道输入的概率塑造和范围结构的动机。我们证明，可以使用不匹配的加法解码度量指标可以完全补偿代码书不匹配，该指标可以实现（非线性）常数组成代码的随机编码误差指数。随着编码率趋向于共同信息，最佳的不匹配度量方法接近后验概率（MAP）度量，表明与不匹配的MAP MAP指标不匹配的代码书对最佳输入分配的能力指标是能力促进的。
We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of simultaneously benefiting both from the probabilistic shaping of the channel input and from the linear structure of the code. We prove that the codebook mismatch can be fully compensated by using a mismatched additive decoding metric that achieves the random coding error exponent of (non-linear) constant composition codes. As the coding rate tends to the mutual information, the optimal mismatched metric approaches the maximum a posteriori probability (MAP) metric, showing that codebook mismatch with mismatched MAP metric is capacity-achieving for the optimal input assignment.
