On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem
We prove equivalence of using the modulus metric and Euclidean metric in solving the soft decoding problem for a memoryless discrete channel with binary input and Q-ary output. For such a channel, we give an example of a construction of binary codes correcting t binary errors in the Hamming metric. The constructed codes correct errors at the output of a demodulator with Q quantization errors as (t + 1)(Q − 1) − 1 errors in the modulus metric. The obtained codes are shown to have polynomial decoding complexity.
Key wordsmodulus metric Euclidean metric soft decoding binary-input Q-ary output channel codes in the modulus metric
Unable to display preview. Download preview PDF.
- 1.Kolesnik, V.D. and Mironchikov, E.T., Dekodirovanie tsiklicheskikh kodov (Decoding of Cyclic Codes), Moscow: Svyaz’, 1968.Google Scholar
- 4.Davydov, V.A., Methods for Error Correction in the Modulus Metric and Derived Metrics, Cand. Sci. (Engrg.) Dissertation, St. Petersburg, 1993.Google Scholar