The 26 linked references in paper M. Elshafey A., М. Эльшафеи А. (2016) “Метод помехоустойчивого кодирования телеметрической информации, исправляющий пропуски и инверсии битов // Error Correcting Coding of Telemetry Information for Channel with Random Bit Inversions and Deletions” / spz:neicon:technomag:y:2014:i:0:p:328-346

  1. Gallager R.G. Low-density parity-check codes // IRE Transactions on Information Theory. 1962. Vol. 8, iss. 1. P. 2l-28. DOI: 10.1109/TIT.1962.1057683
  2. MacKay D.J.C., Neal R.M. Near Shannon limit performance of low density parity check codes // Electronics Letters. 1996. Vol. 32, iss. 18. P. 1645-1646. DOI: 10.1049/el:19961141
  3. MacKay D.J.C. Good Error-Correcting Codes Based on Very Sparse Matrices // IEEE Transactions on Information Theory. 1999. Vol. 45, no. 2. P. 399-431. DOI: 10.1109/18.748992
  4. Sae-Young Chung, Forney G.D. Jr., Richardson T.J., Urbanke R. On the Design of LowDensity Parity-Check Codes within 0.0045 dB of the Shannon Limit // IEEE Communications Letters. 2001. Vol. 5, no. 2. P. 58-60. DOI: 10.1109/4234.905935
  5. Jun Xu, Lei Chen, Lingqi Zeng, Lan Lan, Shu Lin. Construction of low density paritycheck codes by superposition // IEEE Transactions on Communications. 2005. Vol. 53, no. 2. P. 243-251. DOI: 10.1109/TCOMM.2004.841966
  6. Bonello N., Sheng Chen, Hanzo L. Construction of regular quasi cyclic protograph LDPC codes based on Vandermonde matrices // IEEE Transactions on Vehicular Technology. 2008. Vol. 57, no. 4. P. 2583-2588. DOI: 10.1109/TVT.2007.913180
  7. Ammar B., Honary B.,Yu Kou, Jun Xu, Lin S. Construction of low-density parity-check codes based on balanced incomplete block designs // IEEE Transactions on Information Theory. 2004. Vol. 50, no. 6. P. 1257-1269. DOI: 10.1109/TIT.2004.828144 Наука и образование. МГТУ им. Н.Э. Баумана 340
  8. Yu Kou, Shu Lin, Fossorier M.P.C. Low density parity check codes based on finite geometries: a rediscovery and new results // IEEE Transactions on Information Theory. 2001. Vol. 47, no. 7. P. 2711-2736. DOI: 10.1109/18.959255
  9. Rosenthal J., Vontobel P.O. Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis // Proceedings. 2001 IEEE International Symposium on Information Theory. IEEE, 2001. DOI: 10.1109/ISIT.2001.935867
  10. Chen L., Djurdjevic I., Xu J. Construction of quasicyclic LDPC codes based on the minimum weight codewords of Reed-Solomon Codes // Proceedings. International Symposium on Information Theory (ISIT 2004). IEEE, 2004. DOI: 10.1109/ISIT.2004.1365276
  11. Andreadou N., Pavlidou F.-N., Papaharalabos S., Mathiopoulos P.T. Quasi-Cyclic LowDensity Parity-Check (QC-LDPC) Codes for Deep Space and High Data Rate Application // International Workshop on Satellite and Space Communications (IWSSC 2009). IEEE, 2009. P. 225-229. DOI: 10.1109/IWSSC.2009.5286377
  12. Divsalar D., Dolinar S., Jones C. Construction of Protograph LDPC Codes with Linear Minimum Distance // IEEE International Symposium on Information Theory, 2006. P. 664-668. DOI: 10.1109/ISIT.2006.261868
  13. Thuy V. N., Aria N. Rate-Compatible Short-Length Protograph LDPC Codes // IEEE Communications Letters. 2013. Vol. 17, no. 5. P. 948-951. DOI: 10.1109/LCOMM.2013.031313.122046
  14. Richardson T.J., Urbanke R.L. Efficient Encoding of Low-Density Parity Check Codes // IEEE Transactions on Information Theory. 2001. Vol. 47, no. 2. P. 638-656. DOI: 10.1109/18.910579
  15. Xiao-Yu Hu, Eleftheriou E., Arnold D.-M., Dholakia A. Efficient implementations of the sum product algorithm for decoding LDPC codes // IEEE Global Telecommunications Conference (GLOBECOM '01). Vol. 2. IEEE, 2001. P. 25 -29. DOI: 10.1109/GLOCOM.2001.965575
  16. Jinghu Chen, Dholakia A., Eleftheriou E., Fossorier M.P.C., Xiao-Yu Hu. ReducedComplexity Decoding of LDPC Codes // IEEE Transactions on Communications. 2005. Vol. 53, no. 8. P. 1288-1299. DOI: 10.1109/TCOMM.2005.851637
  17. Davey M.C., MacKay D.J.C. Reliable communication over channels with insertions, deletions, and substitutions // IEEE Transaction on Information Theory. 2001. Vol. 47, no. 2. P. 687-698. DOI: 10.1109/18.910582 Наука и образование. МГТУ им. Н.Э. Баумана 341
  18. Santos M.P.F. , Clarke W.A., Ferreira H.C., Swart T.G. Correction of insertions/deletions using standard convolutional codes and the Viterbi decoding algorithm // Proceedings. 2003 IEEE Information Theory Workshop, 2003. P. 187 -189. DOI: 10.1109/ITW.2003.1216726
  19. Viterbi A.J. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm // IEEE Transactions on Information Theory. 1967. Vol. 13, iss. 2. P. 260269. DOI: 10.1109/TIT.1967.1054010
  20. Forney G.D. Jr. The Viterbi Algorithm // Proceedings of the IEEE. 1973. Vol. 61, no. 3. P. 268-278. DOI: 10.1109/PROC.1973.9030
  21. Forney G.D. Jr. Convolutional Code II: Maximum Likelihood Decoding // Information and Control. 1974. Vol. 25, iss. 3. P. 222-266. DOI: 10.1016/S0019-9958(74)90870-5
  22. Berrou C., Glavieux A., Thitimajshima P. Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes. 1 // IEEE International Conference on Communications (ICC '93 Geneva). Technical Program, Conference Record. Vol. 2. IEEE, 1993. P. 1064-1070. DOI: 10.1109/ICC.1993.397441
  23. Barbelescu A.S, Pietrobon S.S. Interleaver Design for Turbo Codes // Electronics Letters. 1994. Vol. 30, no. 25. P. 2107-2108. DOI: 10.1049/el:19941434
  24. Dinoi L., Benedetto S. Design of Fast Prunable S-Random Interleavers // IEEE Transactions on Wireless Communications. 2005. Vol. 4, no. 5. P. 1-9. DOI: 10.1109/TWC.2005.853836
  25. Popovski P., Kocarev L., Risreski A. Design of Flexible-Length S-Random Interleaver for Turbo Codes // IEEE Communications Letters. 2004. Vol. 8, no. 7. P. 461-463. DOI: 10.1109/LCOMM.2004.832737
  26. Jing Sun, Takeshita O.Y. Interleavers for Turbo Codes Using Permutation Polynomial over Integer Rings // IEEE Transactions on Information Theory. 2005. Vol. 51, no. 1. P. 101-119. DOI: 10.1109/TIT.2004.839478 . Наука и образование. МГТУ им. Н.Э. Баумана 34