The Detection of Errors After Error-Correction Decoding

IEEE Transactions on Communications

Volumn 32, Issue 5, 1984, Pages 511-517

  Miller, Michael ^a   Klove, Torleiv ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE, DIGITAL; DATA TRANSMISSION - RELIABILITY; DIGITAL COMMUNICATION SYSTEMS - PERFORMANCE;

CONCATENATED CODES; ERROR RATES; ERROR-CORRECTION DECODING; UNDETECTED ERROR PROBABILITY;

CODES, SYMBOLIC;

EID: 0021422010     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1984.1096094     Document Type: Article

References (44)

1. S. Lin and D. J. Costello, Jr., “Coding For reliable data transmission and storage,” in Protocols and Techniques for Data Communication Networks, F. F. Kuo, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1980, ch. 7.
2. E. Y. Rocher and R. L. Pickholtz, “An analysis of effectiveness of hybrid transmission schemes,” IBM J. Res. Develop., pp. 426–433, July 1970.
3. A. R. K. Sastry, “Performance of hybrid error control schemes on satellite channel,” IEEE Trans. Commun., vol. COM-23, pp. 689–694, July 1975.
4. A. R. K. Sastry and L. N. Kanal, “Hybrid error control using retransmission and generalized burst-trapping codes,” IEEE Trans. Commun., vol. COM-24, pp. 385–393, Apr. 1976.
5. R. E. Khan et al., “Advances in packet radio technology,” Proc. IEEE, vol. 66, pp. 1468–1496, Nov. 1978.
6. A. Drukarev and D. J. Costello, Jr., “ARQ error control using sequential decoding,” in Conf. Rec., Int. Conf. Commun., June 1980.
7. H. Yamamoto and K. Itoh, “ Viteri decoding algorithm for convolutional codes with repeat request,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 540–547, Sept. 1980.
8. D. M. Mandlebaum, “ An adaptive-feedback coding scheme using incremental redundance,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 388–389, May 1974.
9. J. J. Metzner, “Improvements in block-retransmission schemes,” IEEE Trans. Commun., vol. COM-27, pp. 525–532, Feb. 1979.
10. T. C. Ancheta, “Convolutional parity check automatic repeat request, ” presented at the IEEE Int. Symp. Inform. Theory, Grignano, Italy, June 25-29,1979.
11. S. Lin and P. S. Yu, “A hybrid ARQ scheme with parity retransmission for error control of satellite channels,” IEEE Trans. Commun., vol. COM-30, pp. 1701–1719, July 1982.
12. M. J. Miller, “Automatic-repeat-request systems for error control in digital transmission,” Ph.D. dissertation, Univ. Hawaii, May 1982.
13. M. J. Miller and S. Lin, “Parity retransmission ARQ using convolutional codes,” presented at the IEEE Int. Symp. Inform. Theory, Les Arcs, France, June 1982.
14. S. Lin and D. J. Costello, Jr., Coding Fundamentals and Error Control Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1982.
15. M. Y. Hsiao, “A class of optical minimum odd-weight-column SEC-DEC codes,” IBM J. Res. Develop., vol. 14, July 1970.
16. R. T. Chien, “Memory error control: Beyond parity, ” IEEE Spectrum, July 1973.
17. M. Maniar and K. Rallapalli, “Fire codes on custom chip clean up hard disk data,” Electronics, vol. 54, May 1981.
18. H. Matsuda, “Board applies Hamming codes to small-computer memory,” Electronics, vol. 54, May 1981.
19. R. W. Lucky, J. Salz, and E. J. Weldon, Jr., Principles of Data Communication. New York: McGraw-Hill, 1968.
20. S. Lin and P. S. Yu, “ A hybrid ARQ scheme with parity retransmission for error control of satellite channels,” IEEE Trans. Commun., vol. COM-30, pp. 1701–1719, July 1982.
21. V. I. Korzhik, “Bounds on undetected error probability and optimum group codes in a channel with feedback,” Radioteknika, vol. 20, no. 1, pp. 27–33, 1965.
22. Y. Wang and S. Lin, “A modified selective-repeat type-II hybrid ARQ system and its throughput analysis,” presented at the IEEE Int. Symp. Inform. Theory, Les Arcs, France, June 1982.
23. K. Wu, S. Lin, and M. J. Miller, “A hybrid ARQ scheme using multiple shortened cycle codes,” presented at Globecom '82, Miami, FL, Dec. 1982
24. T. Kasami, T. Klóve, and S. Lin, “ On the probability of undetected error of linear block codes,” IEEE Trans. Inform. Theory, vol. IT-29, Jan. 1983.
25. S. K. Leung-Yan-Cheong and M. E. Heilman, “Concerning a bound on undetected error probability,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 235–237, Mar. 1976.
26. S. K. Leung-Yan-Cheong, E. R. Barnes, and D. U. Friedman, “Some properties of undetected error probability of linear codes, ” IEEE Trans. Inform. Theory, vol. IT-25, pp. 110–112, Jan. 1979.
27. J. K. Wolf, A. M. Michelson, and A. H. Levesque, “On the probability of undetected error for linear block codes,” IEEE Trans. Commun., vol. COM-30, pp. 317–324, Feb. 1982.
28. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, vols. I and II. Amsterdam, The Netherlands: North-Holland, 1977.
29. D. C. Gorenstein, W. W. Peterson, and N. Zierler, “Two-error correcting Bose-Chaudhuri codes are quasi-perfect,” Inform. Contr., vol. 3, pp. 291–294, 1960.
30. P. Delsarte, “Four fundamental parameters of a code and their combinational significance,” Inform. Contr., vol. 23, pp. 407–438, 1973.
31. T. Helleseth, T. Klóve, and J. Mykkletveit, “On the covering radius of binary codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 627–628, 1978.
32. T. Helleseth, “No primitive binary t-error-correcting BCH code with t>2 is quasi-perfect,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 361–362, 1979.
33. J. A. Van der Horst and T. Berger, “Complete decoding of triple-error-correcting binary BCH codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 138–147,1976.
34. E. F. Assmus, Jr. and H. F. Mattson, Jr., “Some 3-error-correcting BCH codes have covering radius 5,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 348–349, 1976.
35. T. Helleseth, “All binary 3-error-correcting BCH codes of length 2m- 1 have covering radius 5,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 257–258, 1978.
36. O. Rothaus, “On ‘bent’ functions,” J. Combinatorial Theory, ser. A, vol. 20, pp. 300–305, 1976.
37. E. R. Berlekamp and L. R. Welch, “Weight distributions of the cosets of the (32, 6) Reed-Muller code,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 203–207, 1972.
38. J. Mykkeltveit, “The covering radius of the (128, 8) Reed-Muller code is 56,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 359–362, 1980.
39. N. J. Patterson and D. H. Wiedemann, “The covering radius of the (215, 16) Reed-Muller Code is at least 16 276,” IEEE Trans. Inform. Theory, to be published.
40. J. R. Schatz, “The second-order Reed-Muller code of length 64 has covering radius 18,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 529–530, 1981.
41. A. M. McLoughlin, “The covering radius of the (m - 3)rd order Reed-Muller codes and a lower bound on the (m - 4)th order Reed-Muller codes,” SIAM J. Appl. Math., vol. 37, pp. 419–422, 1979.
42. T. Helleseth, “The weight distribution of the coset leaders for some classes of codes with related parity-check matrices,” Discrete Math., vol. 28, pp. 161–171, 1979.
43. T. Klóve, “The probability of undetected error when a code is used for error correction and detection,” to be published.
44. G. D. Forney, Concatenated Codes. Cambridge, MA: M.I.T. Press, 1966.