Mathematical optimization of decrypting algorithm for soft input decryption
暂无分享,去创建一个
[1] Giuseppe Caire,et al. Almost noiseless joint source channel coding-decoding of sources of memory , 2004 .
[2] Christoph Ruland,et al. On the probability and impact of collisions on soft input decryption , 2010, 2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010).
[3] Peter Vary,et al. Iterative Source-Channel Decoding: Improved System Design Using EXIT Charts , 2005, EURASIP J. Adv. Signal Process..
[4] Christoph Ruland,et al. Probability of collisions in soft input decryption , 2008 .
[5] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[6] L. Litwin,et al. Error control coding , 2001 .
[7] Liesbet Van der Perre,et al. Turbo Codes: Desirable and Designable , 2003 .
[8] David Chase,et al. Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.
[9] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[10] Peter Vary,et al. Efficient near-optimum softbit source decoding for sources with inter- and intra-frame redundancy , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[11] P. Vary,et al. ANALYSIS OF EXTRINSIC INFORMATION FROM SOFTBIT-SOURCE DECODING APPLICABLE TO ITERATIVE SOURCE-CHANNEL DECODING , .
[12] Joachim Hagenauer. Source-controlled channel decoding , 1995, IEEE Trans. Commun..