Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept

Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept

Volumn , Issue , 2005, Pages 1-278

  Kabatiansky, G ^a,b   Krouk, E ^c   Semenov, S ^d  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b INRIA   (France)

^c SAINT PETERSBURG STATE UNIVERSITY OF AEROSPACE INSTRUMENTATION   (Russian Federation)

^d NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CRYPTOGRAPHY; FORWARD ERROR CORRECTION; IMAGE CODING; IMAGE COMPRESSION; ITERATIVE DECODING; NETWORK CODING; NETWORK LAYERS; REED-SOLOMON CODES;

COMPUTER SCIENTISTS; DATA CHARACTERISTICS; ERROR CONTROL CODING; ERROR CORRECTING CODE; ERROR-CORRECTING CODING; POSTGRADUATE STUDENTS; PRACTICAL PROBLEMS; PRACTICAL RECOMMENDATION;

CODING ERRORS;

EID: 84889341039     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0470867574     Document Type: Book

References (165)

1. Spohn, D. L. et al. (2002). Data Network Design. McGraw Hill, New York.
2. Bertsekas, D. and Gallager, R. (1992). Data Networks. Prentice Hall, New Jersey.
3. 3GPP TS 45.003. Channel Coding, V6.0.0 (2003-08).
4. 3GPP TS 25.212. Multiplexing and channel coding (FDD), V5.6.0 (2003-09).
5. Kabatiansky, G. A. and Krouk, E. A. (1993). Coding Decreases Delay of Messages in Networks. IEEE International Symposium on Information Theory. Proceedings.
6. Maxemchuk, N. F. (1975). Dispersity routing, IEEE Conf. Commun. 3 San Francisco.
7. Krouk, E. and Semenov, S. (2002). Application of Coding at the Network Transport Level to Decrease the Message Delay. Proceedings of Third International Symposium on Communication Systems Networks and Digital Signal Processing. 15-17 July 2002 Staffordshire University, UK.
8. Krouk, E. and Semenov, S. (2004). Transmission of Priority Messages with the Help of Transport Coding. Proceedings of 10th International Conference on Telecommunications. Papeete, Tahiti French Polynesia.
9. Byers, J. Luby, M. Mitzenmacher, M. and Rege, A. (1998). Digital Fountain Approach to Reliable Distribution of Bulk Data, in International Computer Science Institute Technical Reports.
10. Shannon, C. E. (1948). A Mathematical Theory of Communication. Bell System Tech.
11. Peterson, W. W. and Weldon, E. J. (1972). Error -Correcting codes. MIT Press, Cambridge, MA.
12. Birkhoff, G. and Mac Lane, S. (1941). A Survey of Modern Algebra, Macmillan, New York.
13. Gallager, R. G. (1968). Information Theory and Reliable Communication. John Wiley & Sons, Chichester, UK.
14. MacWilliams, F. J. and Sloan, J. J. (1977). The Theory of Error-Correcting Codes, North-Holland, Amsterdam, The Netherlands.
15. Evseev, G. S. (1983). Complexity of decoding for linear codes, Probl. Inform. Transm., 19(1), 3-8 (in Russian) and 1-6 (English translation), 1983.
16. Tsfasman, M. A. and Vladuts, S. G. (1991). Algebraic-Geometry Codes, Kluwer, Dordrecht, The Netherlands.
17. Tsfasman, M. A., Vladuts, S. G., and Zink, T. (1982). Modular curves, Shimura curves, and Goppa codes better than Varshamov-Gilbert Bound, Math. nachr., 109, 21-28.
18. Guruswami, V. and Sudan, M. (1999). Improved Decoding of Reed-Solomon Codes and Algebraic Geometry Codes, IEEE Trans. Inform. Theory, 45(6), 1757-1767.
19. Bassalygo, L. A. (1965). New upper bounds for error-correcting codes, Problems of Information Transmission, 4, 41-44.
20. Shannon, C. E., Gallager R. G., and Berlekamp E. R. (1967). Lower bounds to error probability for coding on discrete memoryless channels, Info. and Control, 10, 65-103 and 522-552.
21. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr. and L. R.Welch, New upper bounds on the rate of a code via Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, vol. 23, no. 2, pp. 157- 166, March 1977.
22. Gordon, D. M. (1982). Minimal permutation sets for decoding the binary Golay code, IEEE Trans. Inform. Theory, IT-28, 541-3.
23. Wolfmann, J. (1983). A permutation decoding of the (24, 12, 8) Golay code, IEEE Trans. Inform. Theory, IT-29, 748-51.
24. Krouk, E. A. and Fedorenko, S. V. (1995) Decoding by generalized information sets, Probl. Inform. Transm., 31, (2), 54-61 (in Russian) and 134-9 (English translation).
25. Barg, A. (1998). Complexity issues in coding theory, in Handbook of Coding Theory, vol. 1, (ed. V. Pless and Huffman, W. C.) Elsevier Science, Amsterdam, The Netherlands: pp. 649-754.
26. Dumer, I. (1989). Two decoding algorithms for linear codes, Probl. Inform. Transm., 25, (1), 24-32 (in Russian) and 17-23 (English translation).
27. Dumer, I. (1999). On minimum distance decoding of linear codes, in Proc. 5th Joint Soviet-Swedish Int. Workshop Information Theory, pp. 50-52, Moscow, Russia.
28. Barg, A., Krouk, E. and van Tilborg H. C. A. (1999). On the Complexity of Minimum Distance Decoding of Long Linear Codes, IEEE Trans. Inform. Theory, IT-45, 1392-1405.
29. Gallager, R. (1963). Low-Density Parity-Check Codes. MIT Press, Cambridge, MA.
30. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley, London, U.K..
31. Savage, J. E. (1969 and 1971). The complexity of decoders, I, II, IEEE Trans. Inform. Theory, IT-15, 689-95, IT-17, 77-85.
32. Evseev, G. S. (1983). Complexity of decoding for linear codes, Probl. Inform. Transm., 19, (1), 3-8 (in Russian) and 1-6 (English translation).
33. Barg, A. and Dumer, I. (1986). Concatenated decoding algorithm with incomplete inspection of code vectors, Probl. Inform. Transm., 22, (1), 3-8 (in Russian) and 1-7 (English translation).
34. Coffey, J. T. and Goodman, R. M. F. (1990). The complexity of information set decoding, IEEE Trans. Inform. Theory, 35, 1031-7.
35. Coffey, J. T., Goodman, R. M. F., and Farrell, P. (1991). New approaches to reduced complexity decoding, Discr. Appl. Math., 33, 43-60.
36. Blinovskii, V. M. (1987). Lower asymptotic bound on the number of linear code words in a sphere of given radius in Fn q, Probl. Inform. Transm., 23, (2) 50-3 (in Russian) and 130-2 (English translation).
37. Hwang, T.-Y. (1979). Decoding linear block codes for minimizing word error rate, IEEE Trans. Inform. Theory, IT-25, 733-7.
38. Levitin, L. and Hartmann, C. R. P. (1985). A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm, IEEE Trans. Inform. Theory, IT-31, 378-84.
39. Dumer, I. (1996). Suboptimal decoding of linear codes: Partition technique, IEEE Trans. Inform. Theory, 42, 1971-86.
40. Dumer, I. (1996). Covering lists in maximum likelihood decoding, in Proc. 34th Annu. Allerton Conf. Communications, Control, and Computing, 683-92.
41. Ashikhmin, A. and Barg, A. (1998). Minimal vectors in linear codes, IEEE Trans. Inform. Theory, 44, 2010-17.
42. Krouk, E. A. (1989). Decoding complexity bound for linear block codes, Problems of Info. Trans., 25, (3), 103-7 (in Russian) and 251-4 (English translation).
43. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. MIT Press, Cambridge, MA, USA.
44. Knuth, D. E. (1973). The Art of Computer Programming, vol. 3. Reading, MA: Addison-Wesley, Reading, MA, USA.
45. Hamming, R.W. (1950). Error Detecting and Error Correcting Codes, Bell Syst. Tech. J., 29, 147-60.
46. MacWilliams, F. J. and Sloan, J. J., (1977). The Theory of Error-Correcting Codes, North-Holland, Amsterdam, The Netherlands.
47. Reed, I. S. and Solomon, G. (1960). Polynomial codes over certain finite fields, J. SIAM, 8 300-4.
48. Sudan, M. (1997). Decoding of Reed-Solomon Codes beyond the Error-Correction Bound, J. Complexity, 13, 180-93.
49. Guruswami, V. and Sudan, M. (1999). Improved Decoding of Reed-Solomon Codes and Algebraic Geometry Codes, IEEE Trans. Inform. Theory, 45, (6), 1757-67.
50. Hasse, H. (1936). Theorie der höheren Differentiate in einem algebroishen Funcktionenk örper mit vollkommenem Konstantkörper nei belie beger Charakteristic, J. Reine. Ang. Math. 75, 50-4.
51. McEliece, R. J. (2003). The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes, in IPN Progress Report, May.
52. Roth, R. and Ruckenstein, G. (2000). Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory, 46(1):246-57.
53. Kötter, R. (1996). Fast Generalized Minimum-Distance Decoding of Algebraic Geometry and Reed- Solomon Codes, IEEE Trans. Inform. Theory, 42, (3), 721-36.
54. Kötter, R. and Vardy, A. (2000). Algebraic soft-decision decoding of Reed-Solomon codes. in Proceedings of 38th Annual Allerton Conference on Communication, Control and Computing.
55. Gross, W. J., Kschischang, F. R., Koetter, R. and Gulak, P. (2002). Simulation results for algebraic soft-decision decoding of Reed-Solomon codes. In Proceedings of the 21st Biennial Symposium on Communications, pp. 356-60.
56. Nielsen, R. R. and Hoholdt, T. (1998). Decoding Reed-Solomon codes beyond half the minimum distance. In Proceedings of the International Conference on Coding Theory and Cryptography, Mexico.
57. Nielsen, R. R. (2001). List decoding of linear block codes. PhD thesis, Technical University of Denmark.
58. Best, M. R. and Brouwer, A. E. (1977). Triply shortened binary Hamming code is optimal. Discr. Math., 17, 235-45.
59. Kabatyanskii, G. A. and Panchenko, V. I. (1988). Unit-sphere packings and coverings of the Hamming space, Problems of Information Transmissions, 24, (4), 3-16.
60. Hamalainen, H. (1988). Two new binary codes with minimum distance three, IEEE on Information Transmission, 34, 885.
61. Panchenko, V. I. (1988). Packings and coverings over an arbitrary alphabet, Problems of Information Transmissions, 24, (4), 93-6.
62. Varshamov, R. R. and Tenengolts, G. M. (1965). Codes which correct single asymmetric errors, Automation and Remote Control (in Russian), 26, (2), 286-90.
63. Gevorkian, D. N. Avetisian, A. M. and Tigranyan, V. A. (1975). On the construction of codes correcting two errors in Hamming metric over Galois fields, Vychislitelnia Technika, Kuibishev, (3), 19-21. (in Russian).
64. Dumer, I. I. and Zinoviev, V. A. (1978). New maximal code over the Galois field GF(4), Problems of Information Transmission, 14, (3), 24-34.
65. Dumer, I. I. (1995). Nonbinary double-error-correcting codes designed by means of algebraic varieties, IEEE Trans. on of Information Theory, 41, (6), 1550-60.
66. Elias, P. (1957). List decoding for noisy channels, Tech. Report 335, Research Lab. of Electronics, MIT, USA.
67. Gallager, R.G. (1963). Low-density parity-check codes, M.I.T. Press, Cambridge, MA: USA.
68. Gallager, R.G. (1962). Low density parity check codes. IRE Transactions on Information Theory.
69. MacKay, D. (1999). Good error correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45.
70. MacKay, D. and Neal, R. (2001). Near Shannon Limit Performance of Low-Density Parity-Check Codes. IEEE Transactions on Information Theory, 47(2).
71. Richardson, T.J. and Urbanke, R.L. (2001). The Capacity of low-Density Parity-Check Codes Under Message-Passing Decoding. IEEE Transactions on Information Theory, 47(2).
72. Zyablov, V.V. and Pinsker, M.S. (1975). Estimation of the error-correction complexity for Gallager low-density codes. Problemy Peredachi Informatsii, 11(1).
73. Tanner, M. (1981). A Recursive Approach to Low Complexity Codes. IEEE Transactions on Information Theory, IT, 27.
74. Richardson, T.J. Urbanke, R.L., and Shokrollahi, M.A. (2001). Design of Capacity-Approaching Irregular low-Density Parity-Check Codes. IEEE Transactions on Information Theory, 47(2).
75. Richardson, T.J. Urbanke, R.L., and Chung, S.-Y. (2001). Analysis of Sum-Product Decoding of low- Density Parity-Check Codes Using a Gaussian Approximation. IEEE Transactions on Information Theory, 47(2).
76. Hu, X.-Y., Eleftheriou, E., and Arnold, D.-M. (2003). Regular and Irregular Progressive Edge- Growth Tanner Graphs. IBM Research, Zurich Research Laboratory.
77. Blahut, R. (1984). Theory and Practice of Error Control Codes. Addison-Wesley, Reading, MA, USA.
78. Kasami, T., Tokura, N. Ivadari, E., and Inaghaki, Y. (1978). Coding Theory (in Russian). Mir, Russia.
79. Kolesnik, V.D. (1971). Probability decoding of majority codes, Prob. Peredachi Inform., 7, pp. 3-12.
80. Kou, Y., Lin, S. and Fossorier, M.P.C. (2000). Construction of low-density parity-check codes: A geometric approach. In Proc. 2nd Int. Symp. Turbo Codes and Related Topics, pp. 137-140, Brest, France.
81. Kou, Y., Lin, S., and Fossorier, M.P.C. (2001). Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results, IEEE Trans Inf. Theor., 47, (7).
82. Chen, C.-L. (1971). On Majority-Logic Decoding of Finite Geometry Codes. IEEE Transactions on Information Theory, IT, 17(3).
83. Kasami, T. and Lin, S. (1971). On Majority-Logic Decoding for Duals of Primitive Polynomial Codes. IEEE Transactions on Information Theory, IT 17(3).
84. Kolesnik, V. and Mironchikov, E. (1968). Decoding of cyclic codes (In Russian). Svyaz, Russia.
85. Peterson,W.W. andWeldon, Jr. E.J. (1972). Error-Correcting Codes. MIT Press, Cambridge, Mass, USA.
86. Lin, S. (1972). On the Number of Information Symbols in Polynomial Codes. IEEE Transactions on Information Theory, 18(6).
87. Djurdjevic, I., Xu, J. Abdel-Ghaffar, K., and Lin, S. (2003). A Class of Low-Density Parity-Check Codes Constructed Based on Reed-Solomon Codes With Two Information Symbols, IEEE Communication Letters, 7(7).
88. Gilbert, E.N. (1960). A problem in binary encoding. In Proceedings of the Symposium in Applied Mathematics, 10, pp. 291.
89. q+1)/(x+1) Inform. and Contr., 39(3).
90. Krouk, E.A. and Semenov, S.V. (1990). Low-density parity-check burst error-correcting codes. In 2nd International Workshop 'Algebraic and combinatorial coding theory,' pp. 121-4.
91. Zhang,W. andWolf, J. (1988). A Class of Binary Burst Error-Correcting Quasi-Cyclic Codes. IEEE Transactions on Information Theory, 34; pp. 463-79.
92. Tian, T., Jones, C. Villasenor, J., and Wesel, R. (2003). Construction of Irregular LDPC Codes with Low Error Floors. In Proceedings of ICC'2003, Anchorage, Alaska. pp. 3125-9.
93. Lin, S. (1972). Shortened Finite Geometry Codes. IEEE Transactions on Information Theory, 18(5).
94. Ovchinnikov, A. (1999). About one class of burst error-correcting codes. In Proc. of Second Int. school-seminar BICAMP'99, SPb.
95. Ovchinnikov, A. (1999). A class of binary burst error-correcting codes. In Volume 2, EuroXChange.
96. Ovchinnikov, A. (2000). About modification of one class of burst error-correcting codes. In volume 3, EuroXChange.
97. Fossorier, M.P.C. Mihaljevic, M., and Imai, H. (1999). Reduced Complexity Iterative Decoding of Low-Density Parity-Check Codes Based on Belief Propagation. IEEE Transactions on Communications, 47(5).
98. MacWilliams, F. and Sloane, N. (1977). The Theory of Error-Correcting Codes. North-Holland, Amsterdam, The Netherlands.
99. Lechner, G. (2003). Convergence of Sum-Product Algorithm for Finite Length Low-Density Parity- Check Codes. Winter School on Coding and Information Theory, Monte Verita, Switzerland.
100. Lucas, R., Fossorier, M.P.C., Kou, Y., and Lin, S. (2000). Iterative decoding of one-step majority logic decodable codes based on belief propagation. IEEE Trans. Commun., 48(6).
101. Ryan, W.E. (2004). An Introduction to LDPC Codes. In (B. Vasic, ed.) CRC Handbook for Coding and Signal Processing for Recording Systems CRC Press, to be published in 2004.
102. Snyders, J. (1991). Reduced lists of error patterns for maximum likelihood soft decoding, IEEE Trans on Information Theory, Vol. IT-37 pp. 1134-1200.
103. Yeo, E. Nikolic, B. and Anatharam, V. (2002). Architectures and Implementations of Low-Density Parity Check Decoding Algorithms, Department of Electrical Engineering and Computer Sciences, University of California, Berkley.
104. Viterbi, A. J. and Omura, J. K. (1979). Principles of Digital Communication and Coding, McGraw- Hill Book Company, N.Y., USA.
105. Viterbi, A. J. (1967). Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm, IEEE Trans. Inf. Theory, IT-13, pp. 260-9.
106. Omura, J. K. (1969). On the Viterbi Decoding Algorithm, IEEE Trans. Inf. Theory, IT-15, pp. 177-9.
107. Proakis, J. G. (1995). Digital Communications, 3rd ed. McGraw-Hill, New York, USA.
108. Rappaport, T. S. (1996). Wireless Communications Principles and Practice, Prentice-Hall, New Jersey, USA.
109. Johannesson, R. and Zigangirov, K. (1999). Fundamentals of Convolutional Coding John Wiley & Sons IEEE Press, Chichester, UK.
110. Berrou, C., Glavieux, A., and Thitimajshima, P. (1993). Near Shannon limit error-correcting coding: turbo codes. Proceedings IEEE International Conference on Communications, Geneva, Switzerland, pp. 1064-70.
111. Woodard, J. P. and Hanzo, L. (2000). Comparative Study of Turbo Decoding Techniques: An Overview. IEEE Transactions on Vehicular Technology, 49, (6) pp. 2208-33.
112. Bahl, L., Cocke, J., Jelinek, F., and Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory, IT-20, pp. 284-87.
113. Koch, W. and Baier, A. (1990). Optimum and sub-optimum detection of coded data disturbed by time-varying inter-symbol interference, IEEE Globecom, pp. 1679-84.
114. Erfanian, J. A., Pasupathy, S., and Gulak, G. (1994). Reduced complexity symbol detectors with parallel structures for ISI channels, IEEE Trans. Commun., 42, pp. 1661-71.
115. Robertson, P. Villebrun, E., and Hoeher, P. (1995). A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain, Proc. Int. Conf. Communications, pp. 1009-13.
116. Hagenauer, J. and Hoeher, P. (1989). A Viterbi Algorithm with Soft-DecisionOutputs and Its Applications, GLOBECOM 1989, Dallas, Texas, pp. 1680-86.
117. Burr, A. (2001). Modulation and Coding for Wireless Communications. Prentice Hall, NJ, USA.
118. Hagenauer, J., Offer, E., and Papke, L. (1996). Iterative Decoding of Binary Block and Convolutional Codes, IEEE Transactions of Information Theory, 42, (2), pp. 429-45.
119. Hagenauer, J. (1995). Source-Controlled Channel Decoding, IEEE Transactions on Communications, 43, (9), pp. 2449-57.
120. Bertsekas, D. and Gallager, R. (1992). Data Networks. Prentice Hall, NJ, USA.
121. Kleinrock, L. (1975). Queuing Systems. Theory, vol.1, John Wiley & Sons, Chichester, UK.
122. Kleinrock, L. (1964). Communication nets; stochastic message flow and delay. Dover, N.Y. USA.
123. Kleinrock, L. and Naylor, W. (1974). On Measured Behavior of the ARPA Network, AFIPS Conf. Proc., National Computer Conf., 1974, 43, pp. 767-80.
124. Kabatiansky, G. A. and Krouk, E. A. (1993). Coding Decreases Delay of Messages in Networks. IEEE International Symposium on Information Theory, Proceedings.
125. Maxemchuk, N. F. (1975). Dispersity routing, IEEE Conf. Commun., 3. San Francisco.
126. Vvedenskaya, N. D. (1998). Large Queuing System where Messages are Transmitted via Several Routes, Problems Of Information Transmission, 34, (2) pp. 180-9.
127. David, H. A. (1981). Order statistics. John Wiley & Sons, Chichester, UK.
128. Krouk, E. and Semenov, S. (2004). Transmission of Priority Messages with the Help of Transport Coding. Proceedings of 10th International Conference on Telecommunications, Tahiti French Polynesia, pp. 1273-8.
129. Schnier, B. (1996). Applied Cryptography: protocols, algorithms and source code in C, (2nd ed.). John Wiley & Sons Chichester, UK.
130. Diffie, W. and Hellman, M.E. (1976). New directions in cryptography, IEEE Transactions on Information Theory, IT-22(6):644-54.
131. Garey, M. R. and Johnson, D.S. (1979). Computers and Intractability. Freeman,W.H. and Company.
132. Merkle, R. C. and Hellman, M. (1978). Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory, IT-24(5):525-30.
133. Niederreiter, H. (1986). Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, 15(2):157-66.
134. Shamir, A. (1984). A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem, IEEE Trans. Inform. Theory, IT-30, pp. 609-704.
135. Berlekamp, E. R., McEliece, R.J. and van Tilborg, H.C.A. (1978). On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, 24(5):384-6.
136. Barg, A., Krouk, E. and van Tilborg, H.C.A. (1999). On the Complexity of Minimum Distance Decoding of Long Linear Codes, IEEE Trans. Inform. Theory, IT-45, pp. 1392-405.
137. McEliece, R. J. (1978). A public-key cryptosystem based on algebraic coding theory. DSN Progress Report, pp. 114-6.
138. Li, Y., Deng, R., andWang, X. (1994). The equivalence of McEliece's and Niederreiter's public-key cryptosystems, IEEE Transactions on Information Theory, 40(1):271-3.
139. Lenstra, A. K. Lenstra Jr., H. W. Manasse, M.S. and Pollard, J.M. (1990). The number field sieve, In ACM Symposium on Theory of Computing, pp. 564-72.
140. Lee, P. J. and Brickel, E.F. (1989). Observation on the Security of McEliece's Public-Key Cryptosystem. Advances in Cryptology-Proceedings of EUROCRYPT'88, pp. 275-80.
141. Krouk, E. New Public-Key Cryptosystem, in Proc. 6th Joint Soviet-Swedish Int. Workshop Information Theory (St.Petersburg, Russia), pp. 285-6.
142. Krouk, E. A. and Fedorenko, S. V. (1995). Decoding by generalized information sets, Problems of Information Transmission, 31(2):143-9.
143. Sidelnikov, V. M. and Shestakov, S. O. (1992). On Insecurity of Cryptosystems Based on Generalized Reed-Solomon Codes, Discrete Mathematics and Applications, 2(4), pp. 57-63.
144. Barg, A. (1998). Complexity issues in coding theory, in (eds V. Pless andW. C. Huffman) Handbook of Coding Theory, vol. 1, Elsevier Science, Amsterdam, The Netherlands. pp. 649-754.
145. E. Gabidulin, A. Paramonov, and O. Tretjakov. Ideals over a non-commutative ring and their application to cryptology. In Advances in Cryptology-EUROCRYPT'91, LNCS-547, Springer- Verlag, 1991, pp. 482-489.
146. MacWilliams, F. J. and Sloan, J. J. (1977). The Theory of Error-Correcting Codes. North-Holland, Amsterdam.
147. Krouk, E. and Sorger, U. (1998). A public key cryptosystem based on total decoding of linear codes, Sixth International Workshop on Algebraic and Combinatorial Coding theory (ACCT-VI), Pskov, Russia.
148. Rivest, R., Shamir, A., and Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems, Commun. Ass. Comput. Mach. 21(2).
149. A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory, 44(1): pp. 367-378, January 1998.
150. N. Sendrier. On the concatenated structure of a linear code. In AAECC, 9(3), pp. 221-242, 1998.
151. N. Sendrier. Finding the permutation between equivalent codes: the support splitting algorithm. IEEE Transactions on Information Theory, 46(4), pp. 1193-1203, July 2000.
152. V. M. Sidelnikov. A public-key cryptosystem based on Reed-Muller codes. Discrete Mathematics and Applications, 4(3) pp. 191-207, 1994.
153. Krouk, E. and Semenov, S. (2002). Application of Coding at the Network Transport Level to Decrease the Message Delay. Proceedings of Third International Symposium on Communication Systems Networks and Digital Signal Processing., Staffordshire University, UK, pp. 109-12.
154. Alon, N. and Luby, M. (1996). A linear time erasure codes with nearly optimal recovery. IEEE Trans. On Inf. Theory, 42, (6), pp. 1732-6.
155. Luby, M., Mitzenmacher, M., Shokrollahi, M., A. Spielman, D. A., and Stemann, V. (1997). Practical loss-resilient codes, in Proc. 29th Ann. Symp. Theory of Computing, 42, (6), pp. 150-9.
156. Luby, M. (2002). LT Codes, in Proc. of the 43rd Annual IEEE Symp. on Foundations of Comp. Science.
157. Gray, R. M. Fundamentals of Vector Quantisation. http://www-isl.stanford.edu/gray/compression.html.
158. Li, J., Gray, R. M., Olshen, R., (1999). Joint Image Compression and Classification with Vector Quantisation and Two Dimentional Hidden Markov Model in Data Compression Conference, IEEE Computer Society TCC, pp. 23-32.
159. Hung, A. C., Tsern, E. K., and Meng T. H., (1998). Error-resilient pyramid vector quantisation for image compression. in IEEE Trans. on Image. Process., 7, Oct. 1998, pp. 1373-86.
160. Lin, J.-H. and Vitter J. S., (1992). Nearly Optimal Vector Quantisation via Linear Programming in Data Compression Conference, IEEE Computer Society TCC. pp. 22-31.
161. Cosman, P. C., Oehler, K. L., Riskin, E. A., and Gray, R. M. (1993). Using vector quantisation for image processing. in Proc. of the IEEE, 81, (9), pp. 1326-41.
162. Bayazit, U. and Pearlman, W. A., (1999). Variable-Length Constrained Storage Tree-Structured Vector Quantisation. IEEE Trans. Image Processing, 8, (3), pp. 321-31.
163. Garey, M. R., Johnson D. S., and Witsenhausen H. S., (1982). The complexity of the generalized Lloyd-Max problem. In IEEE Trans. Inform. Theory, 28, (2), pp. 255-6.
164. Gersho, A. and Gray, R. M., (1992). Vector Quantisation and Signal Compression, Kluwer Academic Publishers, Amsterdam, The Netherlands.
165. Belogolovy, A. V., (1999). Application of error-correcting codes to video compression, Proc. of Sec. Intern. Youth Workshop BICAMP'99, St.Petersburg, Russia, p. 119 (in Russian).