Abstract
This letter describes a technique for finding cyclic redundancy check polynomials for systems for transmission over symmetric channels which encode information in multiple voltage levels, so that the resulting redundancy check gives good error protection and is efficient to implement. The codes which we construct have a Hamming distance of 3 or 4. We discuss a way to reduce burst error in parallel transmissions and some tricks for efficient implementation of the shift register for these polynomials. We illustrate our techniques by discussing a particular example where the number of levels is 9, but they are applicable in general.
Document Type
Article
Publication Date
10-1998
Publisher Statement
Copyright © 1998, IEEE Communications Society. This article first appeared in IEEE Transactions on Communications: 46:10 (1998), 1250-1253.
Please note that downloads of the article are for private/personal use only.
Recommended Citation
Davis, James A., Miranda Mowbray, and Simon Crouch. "Finding Cyclic Redundancy Check Polynomials for Multilevel Systems." IEEE Transactions on Communications 46, no. 10 (October 1998): 1250-253.