Abstract
The nonlinear binary codes have a great disadvantage of difficult enumeration of the results due to the necessity of solving a nonlinear set of equations. In the common case, the computational effort will be equal to the effort of solving a set of nonlinear binary equations with a big number of variables. On the other hand, the nonlinear codes substantially overcome the best parameters of the linear ones. It is possible to design such nonlinear binary cyclic codes that have numbers of individually specified bits substantially bigger than can be obtained for linear ones. In this paper, we discuss properties of built-in pseudo-exhaustive test pattern generators and test compressors that employ the nonlinear binary codes. We elaborate the previous results with new simulations. The results can be used for generator or decompressor structure optimization. We formulate several topics that have to be solved in future to enable practical application of the nonlinear codes in testing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
