On the applicability of the most reliable basis algorithm for LDPC decoding in telecommand links
暂无分享,去创建一个
[1] Roxana Smarandache,et al. Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds , 2009, IEEE Transactions on Information Theory.
[2] Shu Lin,et al. Soft-decision decoding of linear block codes based on ordered statistics , 1994, IEEE Trans. Inf. Theory.
[3] Marco Baldi,et al. A Hybrid Decoding Scheme for Short Non-Binary LDPC Codes , 2014, IEEE Communications Letters.
[4] Evangelos Eleftheriou,et al. On the computation of the minimum distance of low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[5] Marc P. C. Fossorier,et al. Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..
[6] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[7] Stefano Cioni,et al. Analysis and performance evaluation of new coding options for space telecommand links - Part I: AWGN channels , 2015, Int. J. Satell. Commun. Netw..
[8] N. S. Barnett,et al. Private communication , 1969 .
[9] Hoglah Leena Bollam. FINITE-PRECISION ANALYSIS OF DEMAPPERS AND DECODERS FOR LDPC-CODED M-QAM SYSTEMS , 2014 .
[10] Franco Chiaraluce,et al. Error correcting codes in telecommand and telemetry for European Space Agency missions: An overview and new perspectives , 2014, 2014 22nd International Conference on Software, Telecommunications and Computer Networks (SoftCOM).