Burst-Correcting Codes for the Classic Bursty Channel

IEEE Transactions on Communication Technology

Volumn 19, Issue 5, 1971, Pages 772-781

  Forney, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0015142301     PISSN: 00189332     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1971.1090719     Document Type: Article

References (43)

1. G. D. Forney, Jr., “Coding and its application in space communications,” IEEE Spectrum, vol. 7, June 1970, pp. 47–58.
2. E. N. Gilbert, “Capacity of a burst-noise channel,” Bell. Syst. Tech. J., vol. 39, Sept, 1960, pp. 1253–1265.
3. R. C. Singleton, “Maximum distance q-nary codes,” IEEE Trans. Inform. Theory, vol. IT-10, Apr. 1964, pp. 116–118.
4. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968, pp. 309–311.
5. I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” SIAM J. Appl. Math., vol. 8, June 1960, pp. 300–304.
6. G. D. Forney, Jr., Concatenated Codes. Cambridge, Mass.: M.I.T. Press, 1966.
7. S. H. Reiger, “Codes for the correction of ‘clustered’ errors,” IRE Trans. Inform. Theory, vol. IT-6, Mar. 1960, pp. 16–21.
8. A. D. Wyner and R. B. Ash, “Analysis of recurrent codes,” IEEE Trans. Inform. Theory, vol. IT-9, July 1963, pp. 143–156.
9. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
10. J. L. Massey, Notes on Coding Theory. Waltham, Mass.: GT&E Lab., 1969, pp. IX/1–3.
11. G. D. Forney, Jr., “Periodic interleavers,” in preparation.
12. W. R. Cowell and H. O. Burton, “Computer simulation of the use of group codes with retransmission on a Gilbert burst channel,” AIEE Trans. (Commun. Electron.), vol. 80, Jan. 1962, pp. 577–585.
13. J. L. Ramsey, “Realization of optimum interleavers,” IEEE Trans. Inform. Theory, vol. IT-15, May 1970, pp. 338–345.
14. H. O. Burton, “Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. IT-17, Jan. 1971, pp. 92–95.
15. W. W. Peterson, Error-Correcting Codes. Cambridge, Mass.: M.I.T. Press, and New York: Wiley, 1961.
16. L. E. Zegers, “Error control in telephone channels by means of time diversity,” Philips Res. Rep., vol. 22, June 1967, pp. 315–328.
17. D. D. Falconer, “A hybrid decoding scheme for discrete memoryless channels,” Bell Syst. Tech. J., vol. 48, Mar. 1969, pp. 691–728.
18. F. Jelinek and J. Cocke, “Bootstrap hybrid decoding for symmetrical binary input channels,” Inform. Contr., vol. 18, Apr. 1971, pp. 261–298.
19. D. L. Cohn, A. H. Levesque, J. H. Meyn, and A. W. Pierce, “Performance of selected block and convolutional codes on a fading HF channel,” IEEE Trans. Inform. Theory, vol. IT-14, Sept. 1968, pp. 627–640.
20. K. Brayer, “The improvement of digital HF communication through coding I—Interleaved cyclic coding,” IEEE Trans. Commun. Technol., vol. COM-16, Dec. 1968, pp. 771–778.
21. —, “The improvement of digital HF communication through coding 11-tandem interleaved cyclic coding,” ibid., pp. 779–786.
22. A. W. Pierce, B. B. Barrow, B. Goldberg, and J. R. Tucker, “Effective application of forward-acting error-control coding to multichannel HF data modems,” IEEE Trans. Commun. Technol., vol. COM-18, Aug. 1970, pp. 281–294.
23. P. Elias, “Coding for practical communications systems,” presented at the URSI 13th General Assembly, London, 1960.
24. J. K. Wolf, “On codes derivable from the tensor product of check matrices,” IEEE Trans. Inform. Theory, vol. IT-11, Apr. 1965, pp. 281–284.
25. H. O. Burton and E. J. Weldon, Jr., “Cyclic product codes,” IEEE Trans. Inform. Theory, vol. IT-11, July 1965, pp. 433–439.
26. E. R. Berlekamp, “A class of convolution codes,” Inform. Contr., vol. 6, 1963, pp. 1–13.
27. —, “Note on recurrent codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-10, July 1964, pp. 257–258.
28. F. P. Preparata, “Systematic construction of optimal linear recurrent codes for burst error correction,” Calcolo, vol. 1, Apr. 1964, pp. 147–153.
29. J. L. Massey, “Implementation of burst-correcting convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-11, July 1965, pp. 416–422.
30. —, “Error correction in coded messages,” U. S. Patent 3 566 352, Feb. 23, 1971.
31. Y. Iwadare, “On type-B1 burst-error-correcting convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-14, July 1968, pp. 577–583.
32. P. E. Ebert and S. Y. Tong, “Convolutional Reed-Solomon codes,” Bell Syst. Tech. J., vol. 48, Mar. 1969, pp. 729–742.
33. H. T. Hsu, “A new class of recurrent codes,” IEEE Trans. Inform. Theory, vol. IT-15, Sept. 1969, pp. 592–597.
34. P. Fire, “A class of multiple-error-correcting binary codes for non-independent errors,” Sylvania Reconnaissance Syst. Lab., Mountain View, Calif., Sylvania Rep. RSL-E-2, 1959.
35. D. W. Hagelbarger, “Recurrent codes: easily mechanized burst-correcting, binary codes,” Bell Syst. Tech. J., vol. 38, July 1959, pp. 969–984.
36. A. Kohlenberg and G. D. Forney, Jr., “Convolutional coding for channels with memory,” IEEE Trans. Inform. Theory, vol. IT-14, Sept, 1968, pp. 618–626.
37. S. Y. Tong, “Systematic construction of self-orthogonal diffuse codes,” IEEE Trans. Inform. Theory, vol. IT-16, Sept. 1970, pp. 594–604.
38. M. J. Ferguson, “‘Diffuse’ threshold decodable rate 1/2 convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-17, Mar. 1971, pp. 171–180.
39. A. H. Frey, Jr., “Adaptive decoding without feedback,” IBM Tech. Rep. TR 48.67.001, Nov. 8, 1967.
40. S. Y. Tong, “Burst-trapping techniques for a compound channel,” IEEE Trans. Inform. Theory, vol. IT-15, Nov. 1969, pp. 710–715.
41. S. M. Reddy, “Linear convolutional codes for compound channels,” submitted to Inform. Contr.
42. H. O. Burton, D. D. Sullivan, and S. Y. Tong, “Generalized burst-trapping codes,” IEEE Trans. Inform. Theory, vol. IT-17, Nov. 1971, pp. 727–735.
43. D. D. Sullivan, “A generalization of Gallager's adaptive error control scheme,” IEEE Trans. Inform. Theory, vol. IT-17, Nov. 1971, pp. 718–727.