Optimum Cyclic Redundancy-Check Codes with 16-Bit Redundancy

IEEE Transactions on Communications

Volumn 38, Issue 1, 1990, Pages 111-114

  Castagnoli, Guy ^a   Ganz, Jurg ^a   Graber, Patrick ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--POLYNOMIALS; PROBABILITY; REDUNDANCY;

BINARY SYMMETRIC CHANNELS; OPTIMUM CYCLIC REDUNDANCY-CHECK CODES; UNDETECTED ERROR PROBABILITY;

CODES, SYMBOLIC;

EID: 0025246456     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.46536     Document Type: Article

References (8)

1. W. W. Peterson and D. T. Brown, “Cyclic codes for error detection,” Proc. IRE, vol. 49, pp. 228–235, Jan. 1961.
2. J. L. Hammond and P. J. P. O'Reilly, Performance Analysis of Local Computer Networks. Reading, MA: Addison-Wesley, 1986.
3. 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.
4. P. Merkey and E. C. Posner, “Optimum cyclic redundancy codes for noisy channels,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 865867, Nov. 1984.
5. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: M.I.T. Press, 1972, 2nd ed.
6. K. K. Tzeng and C. R. P. Hartmann, “On the minimum distance of certain reversible cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 644–646, Sept. 1970.
7. C. Leung, E. R. Barnes, and D. U. Friedman, “On some properties of the undetected error probability of linear codes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 110–112, Jan. 1979.
8. K. A. Witzke and C. Leung, “A comparison of some error detecting CRC code standards,” IEEE Trans. Commun., vol. COM-33, pp. 996–998, Sept. 1985.