前几年研究过多元LDPC码。
关于多元LDPC码的相关文档,你可以直接在Google中搜索即可。以下的文献列表也可供参考:
[1] L. Barnault and D. Declercq, “Fast decoding algorithm for LDPC over GF”, Proc. Inf. Theory
Workshop Paris, France, Mar. 2003, p. 70
[2] H. Song and J. R. Cruz, “Reduced-complexity decoding of Q-ary LDPC codes for magnetic
recording”, IEEE Trans. Magn., vol. 39, pp. 1081-1087, Mar. 2003
[3 D. Declercq and M. Fossorier, “Decoding algorithms for Nonbinary LDPC codes over GF(q)”, IEEE
Trans. Comm., Vol. 55, No. 4, April 2007
[4] A. Voicila, D. Declercq, F. Verdier, M. Fossorier, P. Urard, “Low-complexity, Low-memory EMS
algorithm for non-binary LDPC codes”, in Proceedings of IEEE Int.Conf. Commun, ICC’2007, pp.
671-676, Glasglow, UK, June 2007,
[5] H. Wymeersch, H. Steendam, and M. Moeneclaey, “Log-domain decoding of LDPC codes over
GF(q)”, in Proc. IEEE Int.Conf. Commun., ICC’2004, pp. 772–776, Paris, France, Jun. 2004,
[6] M. Davey and D. J. C. MacKay, “Low density parity check codes over GF(q),” IEEE Commun.
Lett., vol. 2, no. 6, pp. 165–167, Jun. 1998
[7] Laura CONDE-CANENCIA, Ali AL GHOUWAYEL, Emmanuel BOUTILLON,"Complexity Comparison of Non-Binary LDPC Decoders",ICT-MobileSummit 2009 Conference Proceedings.