In this letter, a code construction in the Manhattan metric with a polynomial complexity algebraic decoding algorithm is proposed. It is shown that the code construction combined with a high-order QAM modulation enjoys a better code rate compared to a binary BCH code along with a competitive decoding procedure complexity. A performance gain from the use of the proposed code construction increases with the growth of an order of a QAM modulation. The code construction is mostly perspective in scenarios with high signal-to-noise ratios and decoding latency constraints, which are required for current and further generations of communications systems.

中文翻译：

---

曼哈顿度量中高阶 QAM 调制的编码方案


在这封信中，提出了一种采用多项式复杂度代数解码算法的曼哈顿度量的代码构造。结果表明，与二进制 BCH 码相比，结合高阶 QAM 调制的码结构具有更好的码率以及竞争性的解码过程复杂性。使用所提出的代码构造带来的性能增益随着QAM调制阶数的增长而增加。代码构造主要是在具有高信噪比和解码延迟限制的场景中进行的，这是当前和下一代通信系统所需要的。