Coding Scheme for High-Order QAM Modulations in the Manhattan Metric

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.