This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comment on "Generalized Reed-Muller Forms as a Tool to Detect Symmetries"
July 2003 (vol. 52 no. 7)
pp. 975-976

Abstract—This comment relates to two published articles that used four types of two-variable Boolean symmetries and explained their transitivity conditions and relations with Reed-Muller transform. We show that some research in this area had been done earlier about which the authors are unaware.

[1] C.C. Tsai and M. Marek-Sadovska, “Generalized Reed-Muller Forms as a Tool to Detect Symmetries,” IEEE Trans. Computers, vol. 45, no. 1, pp. 33-40, Jan. 1996.
[2] C.C. Tsai and M. Marek-Sadovska, “Boolean Function Classification via Fixed Polarity Reed-Muller Forms,” IEEE Trans. Computers, vol. 46, no. 2, pp. 173-186, Feb. 1997.
[3] D. Bochmann and B. Steinbach, Logikenwurf mit XBOOLE: Algorithmen und Programme. Berlin: Verlag Technik GmBH, 1991.

Index Terms:
Boolean functions, Boolean symmetries, Reed-Muller transform.
Citation:
Bogdan J. Falkowski, "A Comment on "Generalized Reed-Muller Forms as a Tool to Detect Symmetries"," IEEE Transactions on Computers, vol. 52, no. 7, pp. 975-976, July 2003, doi:10.1109/TC.2003.1214346
Usage of this product signifies your acceptance of the Terms of Use.