Constraint gain

IEEE Transactions on Information Theory

Volumn 50, Issue 9, 2004, Pages 1989-2001

  Fan, John L ^a   Poo, T Lei ^b   Marcus, Brian H ^c  

^a QUALCOMM INC   (United States)

^b Stanford University   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); CONSTRAINT THEORY; DECODING; INTERSYMBOL INTERFERENCE; WHITE NOISE;

CONSTRAINED CODES; ERROR CONTROL CODES; NOISY CONSTRAINED CHANNELS; REVERSE CONCATENATION;

DATA COMMUNICATION SYSTEMS;

EID: 4544318729     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.833349     Document Type: Article

References (25)

1. Proc. IEEE Int. Conf. Communications Channels With Memory," in Proc. IEEE Int. ,Conf. Communications, Helsinki, Finland, June 2001, Pp. 2692-2695.
2. W. G. Bliss, "Circuitry for performing error correction calculations on baseband encoded data to eliminate error propagation," IBM Tech. Discl. Bull., vol. 23, pp. 4633-4634, 1981.
3. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
4. J. C. de Souza, B. H. Marcus,.R. New, and B. A. Wilson, "Constrained systems with unconstrained positions," IEEE Trans. Inform. Theory, vol. 48, pp. 866-879, Apr. 2002.
5. J. L. Fan, Constrained Coding and Soft Iterative Decoding. Norwell, MA: Kluwer Academic, 2001.
6. J. L. Fan and A. R. Calderbank, "A modified concatenated coding scheme, with applications to magnetic storage," IEEE Trans. Inform. Theory, vol. 44, pp. 1565-1574, July 1998.
7. J. Fan and J. Cioffi, "Constrained coding techniques for soft iterative decoders," in Proc. GLOBECOM, Rio de Janeiro, Brazil, Dec. 5-9, 1999 pp. 723-727.
8. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
9. C. D. Heegard, A. Duel-Hallen, and R. Krishnamoorthy, "On the capacity of the noisy runlength channel," IEEE Trans. Inform. Theory, vol. 37, pp. 712-720, May 1991.
10. K. A. S. Immink, "A practical method for approaching the channel capacity of constrained channels," IEEE Trans. Inform. Theory, vol. 43, pp. 1389-1399, Sept. 1997.
11. K. A. S. Immink, Codes for Mass Data Storage Systems. Amsterdam, The Netherlands: Shannon Foundation Publishers, 1999.
12. K. A. S. Immink, P. H. Siegel, and J. K. Wolf, "Codes for digital recorders," IEEE Trans. Inform. Theory, vol. 44, pp. 2260-2299, Oct. 1998.
13. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. IEEE GLOBECOM, San Antonio, TX, 2001.
14. H. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1767-1773, Nov. 1997.
15. M. Mansuripur, "Enumerative modulation coding with arbitrary constraints and post-modulation error correction coding and data storage systems," Proc. SPIE, pp. 72-86, 1991.
16. B. H. Marcus, K. Petersen, and S. Williams, "Transmission rates and factors of Markov chains," Contemp. Math., pp. 279-292, 1984.
17. B. H. Marcus, R. M. Roth, and P. H. Siegel, Handbook of Coding Theory. Amsterdam, The Netherlands: Elsevier, 1998, ch. 20.
18. B. H. Marcus, P. H. Siegel, and J. K. Wolf, "Finite-state modulation codes for data storage," IEEE J. Select. Areas Commun., vol. 10, pp. 5-37, 1992,
19. A. Patapoutian and P. V. Kumar, "The (d, k) subcode of a linear block code," IEEE Trans. Inform. Theory, vol. 38, pp. 1375-1382, July 1992.
20. H. D. Pfister, J. B. Soriaga, and E H. Siegel, "On the achievable information rates of finite state isi channels," in Proc. IEEE GLOBECOM, San Antonio, TX, 2001.
21. S. A. Raghavan, J. K. Wolf, and L. B. Milstein, "On the cutoff rate of a discrete memoryless channel with (d, k)-conslxained input sequences," IEEE J. Select. Areas Commun., vol. 10, pp. 233-241, Jan. 1992.
22. C.E. Shannon, "A mathematical theory of communications," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
23. A.J. van Wijngaarden and K. A. S. Immink, "Maximum runlength-limited codes with error control capabilities," IEEE J. Select. Areas Commun., vol. 19, pp. 602-611, Apr. 2001.
24. P. Vontobel and D. Arnold, "An upper bound on the capacity of channels with memory and constrained input," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sept. 2001.
25. E. Zehavi and J. K. Wolf, "On runlength codes," IEEE Trans. Inform. Theory, vol. 34, pp. 45-54, Jan. 1988.