Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
