The Cyclic Redundancy Check (CRC) is an efficient method to detect errors in data transmission using a checksum as a result of polynomial division. The quality of this technique depends extremely on the divisor polynomial used. Although CRC is well established in communication, it is still a challenge to identify suitable polynomials, since the determination of the characteristics of a polynomial is usually very complex. In the paper a method is presented that handles the complexity by means of deterministic and stochastic automata.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.