Books
in black and white
Main menu
Home About us Share a book
Books
Biology Business Chemistry Computers Culture Economics Fiction Games Guide History Management Mathematical Medicine Mental Fitnes Physics Psychology Scince Sport Technics
Ads

The art of error correcting coding - Moreloz R.H.

Moreloz R.H. The art of error correcting coding - Wiley publishing , 2002. - 232 p.
ISBN 0471-49581-6
Download (direct link): artoferrorcorrecting2002.pdf
Previous << 1 .. 75 76 77 78 79 80 < 81 > 82 83 84 85 .. 86 >> Next

[Rob] P. Robertson, “Improving Decoder and Code Structure of Parallel Concatenated Recursive
202
REFERENCES
Systematic (Turbo) Codes,” Proc. IEEEInt. Conf. Univ. Per. Comm. (ICUPC’94), pp. 183-187, 1994.
[RVH] P. Robertson, E. Villebrun and P. Hoeher, “A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain,” Proc. 1995 IEEE Int. Conf. Comm. (ICC’95), pp. 1009-1013, 1995.
[RW1]P. Robertson and T. W?rz, “Coded Modulation Scheme Employing Turbo Codes,” Electronics Letters, vol. 31, pp. 1546-1547, Aug. 1995.
[RW2] P. Robertson and T. W?rz, “Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes,” IEEE J. Sei. Areas in Comm., vol. 16, no. 2, pp. 206-218, Feb.
1998.
[SSSN] H. R. Sdajadpour, N. J. A. Sloane, M. Salehi and G. Nebe, “Interleaver Design for Turbo Codes,” IEEE J. Sei. Areas in Comm., vol. 19, no. 5, pp. 831-837, May 2001.
[SB] G. Schnabl and M. Bossert, “Soft-Decision Decoding of Reed-Muller Codes as Generalized Multiple Concatenated Codes,” IEEE Trans. Info. Theory, vol. 41, no. 1, pp. 304308, Jan. 1995.
[Sehr] P. Schramm, “Multilevel Coding with Independent Decoding on Levels for Efficient Communication on Static and Interleaved Fading Channels,” Proc. IEEE 1997 Int. Symp. Per., Ind. and Mob. Radio Comm. (PIMRC'97), pp. 1196-1200, 1997.
[Sha] C. Shannon, “A Mathematical Theory of Communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, 1948. Also in Key Papers in the Development of Information Theory, D. Slepian, ed., pp. 5-29, IEEE Press, 1974.
[SLF] R. Shao, S. Lin and M. P. C. Fossorier, “Two Simple Stopping Criteria for Turbo Decoding,” IEEE Trans. Comm., vol. 47, no. 8, pp. 1117-1120, Aug. 1999.
[Sin] R.C. Singleton, “Maximum Distance g-nary Codes,” IEEE Trans. Info. Theory, vol. IT-10, pp. 116-118, 1964.
[SS] M. Sipser and D. A. Spielman, “Expander Codes,” IEEE Trans. Info. Theory, vol. 42, no.
6, pp. 1710-1722, Nov. 1996. '
[Sie] D. Slepian, “A Class of Binary Signaling Alphabets,” Bell. Sys. Tech. J., vol. 35, pp. 203234, Jan. 1956.
[Slo] N. J. A. Sloane, S. M. Reddy and C.-L. Chen, “New Binary Codes,” IEEE Trans. Info.
Theory, vol. IT-18, no. 4, pp. 503-510, July 1972.
[Sud] M. Sudan, “Decoding of Reed-Solomon Codes Beyond the Error-Correction Bound,” J.
Complexity, vol. 12, pp. 180-193, Dec. 1997.
[SKHN] Y. Sugiyama, Y. Kasahara, S. Hirasawa and T. Namekawa, “A Method for Solving Key Equation for Goppa Codes,” Info, and Control, vol. 27, pp. 87-99, 1975.
[Sug] Y. Sugiyama, M. Kasahara, S. Hirasawa and T. Namekawa, “Further Results on Goppa Codes and Their Applications to Constructing Efficient Binary Codes,” IEEE Trans. Info. Theory, vol. IT-22, pp. 518-526, 1978.
[TP] D. J. Taipale and M. B. Pursley, “An Improvement to Generalized Minimum Distance Decoding,” IEEE Trans. Info. Theory, vol. 37, no. 1, pp. 167-172, Jan. 1991.
[TYFKL] T. Takata, Y. Yamashita, T. Fujiwara, T. Kasami and S. Lin, “On a suboptimum decoding of decomposable block codes,” IEEE Trans. Info. Theory, vol. 40, no. 5, pp. 13921406, Sept. 1994.
[TC] O. Y. Takeshita and D. J. Costello, Jr., “New Deterministic Interleaver Designs for Turbo Codes,” IEEE Trans. Info. Theory, vol. 46, no. 6, pp. 1988-2006, Sept. 2000.
[TLFL] H. Tang, Y. Liu, M. P. C. Fossorier and S. Lin, “On Combining Chase-2 and GMD Decoding Algorithms for Nonbinary Block Codes,” IEEE Comm. Letters, vol. 5, no. 5, pp. 209-211, May 2001.
[Tan] R. M. Tanner, “A Recursive Approach to Low Complexity Codes,” IEEE Trans. Info.
REFERENCES
203
Theory, vol. IT-27, no. 5, pp. 533-547, Sept. 1981.
[tBrl] S. ten Brink , “Convergence of iterative decoding,” Electronics Letters, vol. 35, pp. 806808, May 1999.
[tBr2] S. ten Brink , “Convergence Behaviour of Iteratively Decoded Parallel Concatenated Codes,” submitted to IEEE Trans. Comm., Mar. 2000.
[TKK] H. Tokushige, T. Koumoto and T. Kasami, “An Improvement to GMD-like Decoding Algorithms,” Proc. 2000 IEEE Int. Symp. Info. Theory (ISIT’00), p. 396, Sorrento, Italy, 2000.
[Ungl] G. Ungerboeck, “Channel Coding with Multilevel/Phase Signals,” IEEE Trans. Info. Theory, vol. IT-28, no. 1, pp. 55-67, Ian. 1982.
[Ung2] G. Ungerboeck, “Trellis-Coded Modulation with Redundant Signal Sets I: Introduction,” IEEE Comm. Mag., vol. 25, no. 2, pp. 5-11, Feb. 1987.
[Ung3] G. Ungerboeck, “Trellis-Coded Modulation with Redundant Signal Sets II: State of the Art,” IEEE Comm. Mag., vol. 25, no. 2, pp. 12-21, Feb. 1987.
[Van] W.J. van Gils, “Two Topics on Linear Unequal Error Protection Codes: Bounds on Their Length and Cyclic Code Classes,” IEEE Trans. Info. Theory, vol. IT-29, no. 6, pp. 866-876, Nov. 1983.
[VO] S. A. Vanstone and P. C. van Oorschot, An Introduction to Error Correcting Codes with Applications, Kluwer Academic Publishers, 1989.
[Vitl] A. J. Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,” IEEE Trans. Info. Theory, vol. IT-13, pp. 260-269, April 1967.
[Vit2] A. I. Viterbi, “Convolutional Codes and Their Performance in Communication Systems,” IEEE Trans. Comm., vol. COM-19, no. 4, pp. 751-772, 1971.
Previous << 1 .. 75 76 77 78 79 80 < 81 > 82 83 84 85 .. 86 >> Next