| [1] Shannon C. Communication in the presence of noise[J].Proceedings of the Institute of Radio Engineers, 1949, 37(1): 10-21.[2] McEliece R J. A public-key cryptosystem based on algebraic coding theory[J]. JPL DSN Progress Report, 1978, 42(44): 114-116.[3] Niederreiter H. Knapsack-type cryptosystems and algebraic coding theory[J]. Problems Control and Information Theory, 1986, 15: 159-166.[4] Sidelnikov V M. A public-key cryptosystem based on binary Reed-Muller codes[J]. Discrete Math Appl, 1994, 4(3): 191-207.[5] Marquez-Corbella I, Pellikaan R. Error-correcting pairs for a public-key cryptosystem[DB/OL]. Code-based Cryptography Workshop, (2012-05-16)[2014-03-11]. http://arxiv.org/pdf/1205.3647.pdf.[6] Rao T R N, Nam K. Private-key algebraic-coded cryptosystems[C]//Procedings on advances in cryptology-CRYPTO’86. London: Springer-Verlag, 1986: 35-48.[7] Hwang T, Rao T R N. Secret error-correcting codes(SECC)[C]//Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO’ 88), Santa Barbara, 1988, 403: 540-563.[8] Chen D Y, Zhang C. Joint channel security coding based on interleaver and puncturer in turbo code[C]//Web Society (SWS) 2011 3rd Symposium. Port Elizabeth: IEEE, 2011: 153-157.[9] Payandeh A, Ahmadian M, Reza Aref M. Adaptive secure channel coding based on punctured turbo codes[J]. IEE Proceedings-Communications, 2006, 153(2): 313-316.[10] Kousa M A, Mugaibel A H. Puncturing effects on turbo codes[J]. IEE Proceedings-Communications, 2002, 149(3): 132-138.[11] Robertson P. Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes[J]. Proceedings of Globecom. 1994, 3: 1 298-1 303.[12] Hagenauer J, Offer E, Papke L. Iterative decoding of binary block and convolutional codes[J]. IEEE Transactions on Information Theory. 1996, 42(2): 429-445.[13] Shao R, Lin S, Papke L. Two simple stopping criteria for turbo decoding[J]. IEEE Transactions on Communications, 1999, 47(1): 1 117-1 120.[14] Wu Y F, Woerner B, Ebel J. A simple stopping criterion for turbo decoding[J]. IEEE Communication Letters, 2000, 4(8): 258-260.[15] Matache A, Dolinar S, Pollara F. Stopping rules for turbo decoders[J]. JPL TMO Progress Report, 2000, 42: 1-22.[16] Amamra I, Decouiche N. A stopping criteria for turbo decoding based on the LLR histogram[C]//Electro technical Conference (Melecon). Yasmine Hammamet: IEEE, 2012: 699-702.[17] Frey B J, Kschischang F R. Early detection and trellis splicing: reduced-complexity iterative decoding[J]. IEEE Journal on Selected Areas in Communications, 1998, 16(2): 153-159.[18] Kim D H, Kim S W. Bit-level stopping of turbo decoding[J]. IEEE Communication Letters, 2006, 10(3):183-185.[19] Wu J H, Wang Z D, Vojcic B R. Partial iterative decoding for binary turbo codes via cross-entropy based bit selection[J]. IEEE Transactions on Communications, 2009, 57(11): 3 298-3 306.[20] 3GPP, Multiplexing and channel coding (FDD) [EB/OL]. 3GPP TS 25.212, V 11.6.0 Release 11, 2013: 19-24[2013-10-05]. http://www.3gpp.org/specifications/releases/69-release-11. |
