Non-Binary Error Control Coding for Wireless Communication and Data Storage

Non-Binary Error Control Coding for Wireless Communication and Data Storage

Volumn , Issue , 2008, Pages 1-303

  Carrasco, Rolando Antonio ^a,b   Johnston, Martin ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b Institution of Engineers and Technology (IET)   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84855932611     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470740415     Document Type: Book

References (120)

1. Shannon, C.E. (1948) A mathematical theory of communication. Bell Systems Technical Journal, 27, 379-423, 623-56.
2. Shannon, C.E. (1998) Communications in the presence of noise. Proceedings of IEEE, 86, 447-58.
3. McEliece, R.J. (1977) The Theory of Information and Coding, Addison-Wesley, Massachusetts.
4. Abramson, N. (1962) Information Theory and Coding, McGraw-Hill, New York.
5. Proakis, J.G. (1989) Digital Communications, 2nd edn, McGraw-Hill, New York.
6. Parsons, J.D. (2000) The Mobile Radio Propagation Channel, 2nd edn, John Wiley & Sons Inc.
7. Clarke, R.H. (1968) A statistical theory of mobile-radio reception. Bell Systems Technical Journal, 47, 957-1000.
8. Jakes, W.C. (1994) Microwave Mobile Communications, John Wiley & Sons, Inc., New York.
9. Hata, M. (1980) Empirical formula for propagation loss in land mobile radio services. IEEE Transactions on Vehicular Technology, VT-29 (3), 317-25.
10. IEEE 802.16 (2001) IEEE Standard for Local and Metropolitan Area Networks: part 1b, Air Interface for Fixed Broadband Wireless Access Systems, April 8, 2002.
11. Aulin, T. (1979)Amodified model for the fading signal at a mobile radio channel. IEEE Transactions on Vehicular Technology, VT-28 (3), 182-203.
12. Greenstein, L.J., Erceg, V., Yeh, Y.S. and Clark, M.V. (1997) A new path-gain/delay-spread propagation model for digital cellular channels. IEEE Transactions on Vehicular Technology, 46 (2), 477-85.
13. IEEE 802.11 (1994) Wireless Access Method and Physical Layer Specification, New York.
14. Erceg, V. (1999) An empirically based path loss model for wireless channels in suburban environments. IEEE Journal in Selected Areas in Communications, 17 (7), 1205-11.
15. Vasic, B. and Kurtas, E.M. (eds) (2005) Coding and Signal Processing for Magnetic Recording Systems, CRC Press.
16. Moon, J. and Zeng, W. (1995) Equalization for maximum likelihood detectors. IEEE Trans. Mag., 31 (2), 1083-8.
17. Lin, S. and Costello, D.J. Jr. (2004) Error Control Coding, 2nd edn, Pearson Prentice Hall, ISBN 0-13-017973-6.
18. Wicker, S.B. (1995) Error Control Systems for Digital Communication and Storage, Prentice Hall, Eaglewood Cliffs, NJ, ISBN 978-0132008099.
19. Blake, I.F., Heegard, C., Hoholdt, T. and Wei, V. (1998) Algebraic geometry codes. IEEE Trans. Inform. Theory, 44 (6), 2596-618.
20. Pretzel, O. (1998) Codes and Algebraic Curves, Oxford Science Publications, Oxford University Press (Oxford Lecture Series in Mathematics and its Applications 8), ISBN 0198500394.
21. Driencourt, Y. (1985) Some properties of elliptic codes over a field of characteristic 2. Proceedings of AAECC-3, 229, 185-93, Lecture Notes in Computer Science.
22. Høholdt, T. and Nielsen, R.R. (1999) Decoding Hermitian codes with Sudan's algorithm, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Vol. 1719, Springer-Verlag, Berlin, Germany, pp. 260-70 (Lecture Notes in Computer Science).
23. Hamming, R. (1950) Error detecting and error correcting codes. Bell Systems Technical Journal, 29, 41-56.
24. Hocquenghem, A. (1959) Codes correcteurs d'erruers. Chiffres, 2, 147-56.
25. Bose, R. and Ray-Chaudhuri, D. (1960) On a class of error-correcting binary codes. Information and Control, 3, 68-79.
26. Reed, I. and Solomon, G. (1960) Polynomial codes over certain finite fields. Journal of the Society of Industrial Mathematics, 8, 300-4.
27. Sugiyama, Y., Kasahara, M., Hirasawa, S. and Namekawa, T. (1975) A method for solving key equation for Goppa codes. Information and Control, 27, 87-9
28. Berlekamp, E. (1967) Nonbinary BCH decoding. Proceedings of the International Symposium on Information Theory, San Remo, Italy.
29. Massey, J.L. (1969) Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, IT-15 (1), 122-7.
30. Ungerboeck, G. (1982) Channel coding with multilevel/phase signals. IEEE Transactions on Information Theory, 28 (1), 55-67.
31. Viterbi, A.J. (1971) Convolutional codes and their performance in communication systems. IEEE Transactions on Communications Technology, 19 (5), 751-72.
32. Moon, T.K. (2005) Error Correction Coding. Mathematical Methods and Algorithms, Wiley Interscience, ISBN 0-471-64800-0.
33. Prange, E. (1958) Cyclic Error-Correcting Codes in Two Symbols, Air Force Cambridge Research Center, Cambridge, MA, Technical Report, TN-58-156.
34. Wicker, S.B. (1995) Error Control Systems for Digital Communications and Storage, Prentice Hall, Eaglewood Cliffs, NJ.
35. Forney, G.D. (1965) On decoding BCH codes. IEEE Transactions on Information Theory, 11 (4), 549-57.
36. Imai, H. and Hirakawa, S. (1977) A new multilevel coding method using error-correcting codes. IEEE Transactions on Information Theory, 23 (3), 371-7.
37. Lin, S. and Costello, D.J. Jr. (2004) Error Control Coding, 2nd edn, Pearson Prentice Hall, ISBN 0-13-017973-6.
38. Wolf, J.K. (1978) Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Transactions on Information Theory, 24 (1), 76-80.
39. Paravalos, E. and Fleisher, S. (1991) Block coded modulation: an application to frequency/phase modulation and a procedure for the construction of trellis diagram. IEEE Proceedings of Pacific Rim Conference on Communications, Computers and Signal Processing, Victoria, USA, pp. 79-82.
40. Baldini, F.R. and Farrell, P.G. (1994) Coded modulation based on rings of integers modulo-. Part 1: block codes. IEE Proceedings Communications, 141 (3), 129-36.
41. Goppa, V.D. (1981) Codes on algebraic curves. Soviet Math. Dokl., 24, 75-91.
42. Justesen, J., Larsen, K.J., Jensen, H. E. et al. (1989) Construction and decoding of a class of algebraic geometry codes. IEEE Trans. Inform. Theory, IT-35, 811-21.
43. Blake, I.F., Heegard, C., Hoholdt, T. and Wei, V. (1998) Algebraic geometry codes. IEEE Trans. Inform. Theory, 44 (6), 2596-618.
44. Atkinson, K.A. (1989) An Introduction to Numerical Analysis, 2nd edn, John Wiley & Sons, Inc., New York, ISBN 0-471-50023-2.
45. Heegard, C., Little, J. and Saints, K. (1995) Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes. IEEE Trans. Inform. Theory, 41 (6), 1752-61.
46. Sakata, S. (1988) Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array. J. Symbolic Computation, 5, 321-37.
47. Justesen, J., Larsen, K.J., Jensen, H.E. and Hoholdt, T. (1992) Fast decoding of codes from algebraic plane curves. IEEE Trans. Inform. Theory, IT-38 (6), 1663-76.
48. Feng, G.L. andRao, T.R.N. (1993) Decoding algebraic geometric codes up to the designedminimum distance. IEEE Trans. Inform. Theory, IT-39, 37-46.
49. Sakata, S., Justesen, J., Madelung, Y. et al. (1995) Fast decoding of algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Inform. Theory, IT-41 (5), 1672-7.
50. Saints, K. and Heegard, C. (1995) Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases. IEEE Transactions on Information Theory, 41 (6), 1733-51.
51. Johnston, M. and Carrasco, R.A. (2005) Construction and performance of algebraic-geometric codes over the AWGN and fading channels. IEE Proc. Commun., 152 (5), 713-22.
52. Carrasco, R.A. and Johnston, M. (2007) Hermitian codes on magnetic recording channels. 9th International Symposium on Communication Theory and Applications, Ambleside, Lake District, UK.
53. Liu, C.-W. (1999) Determination of error values for decoding Hermitian codes with the inverse affine fourier transform. IEICE Trans. Fundamentals, E82-A (10), 2302-5.
54. Elias, P. (1957) List Decoding for Noisy Channels, Res. Lab. Electron, MIT, Cambridge, MA.
55. Elias, P. (1991) Error-correcting codes for list decoding. Information Theory, IEEE Transactions, 37, 5-12.
56. Wozencraft, J.M. (1958) List Decoding, Res. Lab. Electron, MIT, Cambridge, MA.
57. McEliece, R.J. (2003) The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes, California Institute. Tech, Pasadena, California, IPN Progress Rep, pp. 42-153.
58. Koetter, R. and Vardy, A. (2003) Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans. Inform. Theory, 49, 2809-25.
59. Guruswami, V. and Sudan, M. (1999) Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans. Inform. Theory, 45, 1757-67.
60. Hasse, H. (1936) Theorie der hoheren differentiale in einem algebraishen funcktionenkorper mit vollkommenem konstantenkorper nei beliebeger charakteristic. J. Reine. Aug. Math, 175, 50-4.
61. Koetter, R. (1996) On algebraic decoding of algebraic-geometric and cyclic codes. Linkoping, Sweden: University Linkoping.
62. Nielsen, R.R. (2001) List decoding of linear block codes. Lyngby, Denmark: Tech. Univ. Denmark.
63. Moon, T.K. (2005) Error Correction Coding-Mathematical and Algorithms, Wiley Interscience.
64. Høholdt, T. and Nielsen, R.R. (1999) Decoding Hermitian codes with Sudan's algorithm, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (eds H.I.N. Fossorier, S. Lin, and A. Pole), (Lecture Notes in Computer Science), Vol. 1719, Springer-Verlag, Berlin, Germany, pp. 260-70.
65. Feng, G.-L. and Tzeng, K.K. (1991) A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with application to decoding cyclic codes. IEEE Trans. Inform. Theory, 37, 1274-87.
66. Chen, L., Carrasco, R.A. and Chester, E.G. (2007) Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency. IET Commun, 1, 241-50.
67. Chen, L. (2007) Design of an efficient list decoding system for Reed-Solomon and algebraic-geometric codes, PhD Thesis School of electrical, electronic and computer engineering. Newcastle-upon-Tyne: Newcastle University.
68. Roth, R. and Ruckenstein, G. (2000) Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Trans. Inform. Theory, 46, 246-57.
69. Proakis, J.G. (2000) Digital Communications, 4th edn, McGraw-Hill International.
70. Chen, L., Carrasco, R.A. and Johnston, M. (2006) List decoding performance of algebraic geometric codes. IET Electronic Letters, 42, 986-7.
71. Chen, L., Carrasco, R.A. and Johnston, M. (XXXX) Reduced complexity interpolation for list decoding Hermitian codes. IEEE Trans. Wireless Commun, Accepted for publication.
72. Chen,L. and Carrasco, R.A. (2007) Efficient list decoder for algebraic-geometric codes. Presented at 9th International Symposium on Communication Theory and Application (ISCTA'07), Ambleside, Lake district, UK.
73. Wu, X.-W. and Siegel, P. (2001) Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes. IEEE Trans. Inform. Theory, 47, 2579-87.
74. Chen, L., Carrasco, R.A., Johnston, M. and Chester, E.G. (2007) Efficient factorisation algorithm for list decoding algebraic-geometric and Reed-Solomon codes. Presented at ICC 2007, Glasgow, UK.
75. Wu, X.-W. (2002) An algorithm for finding the roots of the polynomials over order domains. Presented at ISIT 2002, Lausanne, Switzerland.
76. Chen, L., Carrasco, R.A. and Johnston, M. (XXXX) Soft-decision list decoding of Hermitian codes. IEEE Trans. Commun, Submitted for publication.
77. Gallager, R.G. (1962) Low-density parity-check codes. IRE Transactions on Information Theory, IT-8, 21-8.
78. Mackay, D.J. and Neal, R.M. (1995) Good codes based on very sparse matrices. Cryptography and Coding, 5th IMA Conference (ed. C. Boyd), Vol. 1025, pp. 100-11 (Lecture Notes in Computer Science, Springer).
79. Chung, S.Y., Forney, G.D. Jr., Richardson, T.J. and Urbanke, R. (2001) On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Communications Letters, 5 (2), 58-60.
80. Ammar, B., Honary, B., Kou, Y. et al. (2004) Construction of low-density parity-check codes based on balanced incomplete block designs. IEEE Transactions on Information Theory, 50 (6), 1257-69.
81. Hu, X.-Y., Eleftheriou, E. and Arnold, D.-M. (2001) Progressive edge-growth tanner graphs. Proceedings of IEEE GlobeCom, San Antonio, Texas, pp. 995-1001.
82. 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 Transactions on Information Theory, 47 (7), 2711-36.
83. Moon, T.K. (2005) Error Correction Coding. Mathematical Methods and Algorithms, Wiley Interscience, ISBN 0-471-64800-0.
84. Barnault, L. and Declerq, D. (2003) Fast decoding algorithm for LDPC over GF(2q). IEEE Information Theory Workshop, Paris, France, pp. 70-3.
85. Sylvester, J.J. (1867) Thoughts on orthogonal matrices, simultaneous sign-successions, and tessellated pavements in two or more colours, with applications to newton's rule, ornamental tile-work, and the theory of numbers. Phil. Mag., 34, 461-75.
86. Davey, M.C. andMackay,D.J. (1998) Lowdensity parity check codes overGF(q). IEEE Information Theory Workshop, Killarney, Ireland, pp. 70-1.
87. Lin, S., Song, S., Zhou, B. et al. (2007) Algebraic constructions of non-binary quasi-cyclic LDPC codes: array masking and dispersion. 9th International Symposium on Communication Theory and Applications (ISCTA), Ambleside, Lake District, UK.
88. Elias, P. (1955) Coding for Noise Channels, IRE Convention Report, Part 4, pp. 37-47.
89. Moon, T.K. (2005) Error Correction Coding. Mathematical Methods and Algorithms, Wiley Interscience, ISBN 0-471-64800-0.
90. Viterbi, A.J. (1967) Error bounds for convolutional codes and asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13, 260-9.
91. Forney, G.D. (1973) The Viterbi algorithm. Proceedings of IEEE, 61, 268-78.
92. Massey, J.L. (1974) Coding and modulation in digital communications. Presented at International Zurich Seminar on Digital Communications, Zurich, Switzerland.
93. Ungerboeck, G. (1982) Channel coding with multilevel/phase signals. Information Theory, IEEE Transactions, 28, 55-67.
94. Biglieri, E., Divisar, D., Melane, P.J. and Simon, M.K. (1991) Introduction to Trellis Coded Modulation with Application, MacMillan, New York.
95. Massey, J.L. and Mittelholzer, T. (1984) Codes over rings-a practical necessity. Presented at AAECC7 International Conference, Universite' P. Sabatier, Toulouse, France.
96. Massey, J. and Mittelholzer, T. (1989) Convolutional codes over rings. Proceedings of the 4th Joint Swedish Soviet Workshop Information Theory, pp. 14-8.
97. Baldini, R.F. and Farrell, P.G. (1990) Coded modulation wit convolutional codes over rings. Presented at Second IEE Bangor Symposium on Communications, Bangor, Wales.
98. Baldini, R.F. and Farrell, P. (1994) Coded modulation based on rings of integers modulo-q part 2: convolutional codes. IEE Proceedings: Communications, 141, 137-42.
99. Carrasco, R., Lopez, F. and Farrell, P. (1996) Ring-TCM for M-PSK modulation: AWGN channels and DSP implementation. Communications, IEE Proceedings, 143, 273-80.
100. Carrasco, R. and Farrell, P. (1996) Ring-TCM for fixed and fading channels: land-mobile satellite fading channels with QAM. Communications, IEE Proceedings, 143, 281-8.
101. Lopez, F.J., Carrasco, R.A. and Farrell, P.G. (1992) Ring-TCM Codes over QAM. IEE Electronics Letter, 28, 2358-9.
102. Tarokh, V., Seshadri, N. and Calderbank, A. (1998) Space-time codes for high data rate wireless communication: performance criterion and code construction. Information Theory, IEEE Transactions on, 44, 744-65.
103. Benedetto, S., Mondin, M. and Montorsi, G. (1994) Performance evaluation of trellis-coded modulation schemes. Proceedings of the IEEE, 82, 833-55.
104. Goldberg, D. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
105. Soto, I. and Carrasco, A. (1997) Searching for TCM codes using genetic algorithms. Communications, IEE Proceedings, 144, 6-10.
106. Pereira, A. and Carrasco, R. (2001) Space-time ring TCM codes for QPSK on time-varying fast fading channels. Electronics Letters, 37, 961-2.
107. Carrasco, R. and Pereira, A. (2004) Space-time ring-TCM codes for QAM over fading channels. IEE Proceedings Communications, 151 (4), 316-21.
108. Pereira, A. (2003) Space-Time Ring TCM Codes on Fading Channels. PhD Thesis, Staffordshire University, Staffordshire, UK.
109. Horn, R. and Johnson, C. (1990) Matrix Analysis, Cambridge University Press, Cambridge, UK, ISBN 0-521-38632-2.
110. Naguib, A., Tarokh, V., Seshadri, N. and Calderbank, A. (1998) A space-time coding modem for high-data-rate wireless communications. Selected Areas in Communications, IEEE Journal, 16, 1459-78.
111. Berrou, C., Glaviuex, A. and Thitimijshima, P. (1993) Near shannon limit error-correcting coding and decoding: turbo codes. Proceedings of the IEEE International Conference on Communications, Geneva, Switzerland, pp. 1064-70.
112. Bahl, L.R., Cocke, J., Jelinek, F. and Raviv, J. (1972) Optimal decoding of linear codes for minimising symbol error rate. Abstracts of Papers, International Symposium on Information Theory, p. 50.
113. Bahl, L.R., Cocke, J., Jelinek, F. and Raviv, J. (1974) Optimal decoding of linear codes for minimising symbol error rate. IEEE Transactions on Information Theory, IT-20 (2), 284-7.
114. Pyndiah, R., Glavieux, A., Picart, A. and Jacq, S. (1994) Near optimum decoding of products codes. Proceedings of the IEEE GlobeCom'94 Conference San Francisco, CA, Vol. 1/3, pp. 339-43.
115. McAdam, P.L.,Welch, L. andWeber, C. (1972) MAPbit decoding of convolutional codes. Abstracts of Papers, International Symposium on Information Theory, p. 9.
116. Erfanian, J.A., Pasupathy, S. and Gulot, G. (1994) Reduced complexity symbol detectors with parallel structures for ISI channels. IEEE Transactions on Communications, 42 (234, Part 3), 1661-71.
117. Moon, T.K. (2005) Error Correction Coding. Mathematical Methods and Algorithms, Wiley Interscience, ISBN 0-471-64800-0.
118. Berrou, C., Jezequel, M., Douillard, C. and Kerouedan, S. (2001) The Advantages of Non-Binary Turbo Codes, IEEE Information Theory Workshop, Australia.
119. Berrou, C. and Jezequel, M. (1999) Non-binary convolutional codes for turbo coding. IET Electronics Letters, 35 (1), 39-40.
120. Berkmann, J. (1998) On turbo decoding of non-binary turbo codes. IEEE Communications Letters, 2 (4), 94-6.