Low-Complexity Chase Decoding of Hermitian Codes with Re-encoding Transform and Fast Factorization

This paper proposes the low-complexity Chase (LCC) decoding for Hermitian codes, which is facilitated by the re-encoding transform (ReT) and fast factorization (FF). By identifying
$\eta$
unreliable received symbols,
$2^{\eta}$
test-vectors are formulated. Kotter's interpolation is performed for decoding the test-vectors, in which the common element interpolation is performed once and the uncommon element interpolation is further performed in a binary tree growing fashion. The ReT is introduced to reduce its complexity and latency. Moreover, the FF is introduced to obtain the estimated codewords directly from the interpolation outcome. It eliminates the redundant encoding that identifies the most likely decoding output. Our simulation results show that the decoding complexity and latency are effectively reduced over the prototype LCC decoding of Hermitian codes.