1ABORHEY S. Reed-Muller tree-based minimization of fixed polarity Reed-Muller expansions [J]. IEE Pree-Cemput Digit Teeh, 2001, 148(2): 63--70.
2GREEN D H, DSC P, FIEE C. Reed-Muller expansions with fixed and mixed polarities over GF (4)[J].IEE Proceedings, 1990, 137(5): 380--388.
3WU Xun-wei, CHEN Xie-xiong, HURST S L. Mapping of Reed-Muller coefficients and the minimization of Exclusive-OR switching function [J]. IEE Proc-Comput Digit Tech, 1982, 129(1): 15--20.
4WU X, CHEN X, HURST S L. Mapping of Reed-Muller coefficients and the minimization of exclusive OR-switching functions[J]. IEE Proc pt E, 1982,129 (1):15-20.
5BESSLICH W. Efficient computer method for ExOR logicdesign[J]. IEEProeptE,1983,130(6):203-206.
6GREEN D. Modern Logic Design [M]. Wokingham: Addison-Wesley Publishing Company, 1986.
7GI S N, SANG W K. Recursive evaluation of the gen eralized Reed-Muller coefficients[C]// 33 st IEEE In ternational Symposium on Multiple-Valued Logic. Tokyo: IEEE Society Press, 2003:117-121.