An algorithm for identifying symmetric variables in the canonical OR-coincidence algebra system
暂无分享,去创建一个
[1] Paul Molitor,et al. Least Upper Bounds for the Size of OBDDs Using Symmetry Properties , 2000, IEEE Trans. Computers.
[2] Hafizur Rahaman,et al. Mapping symmetric functions to hierarchical modules for path-delay fault testability , 2003, 2003 Test Symposium.
[3] Chen Xie-xiong. Detection of Partial Symmetric Functions Based on Tabular Method , 2005 .
[4] Bogdan J. Falkowski,et al. Identification of Boolean symmetries in spectral domain of Reed-Muller transform , 1999 .
[5] Bogdan J. Falkowski,et al. Symmetry conditions of Boolean functions in complex Hadamard transform , 1998 .
[6] S. Hurst. Detection of symmetries in combinatorial functions by spectral means , 1977 .
[7] Haibin Kan,et al. On Symmetric Boolean Functions With High Algebraic Immunity on Even Number of Variables , 2011, IEEE Transactions on Information Theory.
[8] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[9] Bogdan J. Falkowski,et al. Single variable symmetry conditions in Boolean functions through Reed-Muller transform , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..
[10] A. E. A. Almaini,et al. Expansion of logical function in the OR-coincidence system and the transform between it and maxterm expansion. , 2003 .
[11] Xia Chen,et al. Mapping of Reed-Muller coefficients and the minimisation of exclusive OR-switching functions , 1982 .
[12] Jon C. Muzio,et al. Antisymmetries in the realization of Boolean functions , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).
[13] Bogdan J. Falkowski,et al. Identification of complement single variable symmetry in Boolean functions through Walsh transform , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).
[14] Yuichi Yoshida,et al. Partially Symmetric Functions Are Efficiently Isomorphism Testable , 2015, SIAM J. Comput..
[15] Avishay Tal,et al. On the minimal fourier degree of symmetric Boolean functions , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[16] Alon Orlitsky,et al. Expected query complexity of symmetric boolean functions , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[17] Panganamala Ramana Kumar,et al. Optimal Computation of Symmetric Boolean Functions in Collocated Networks , 2013, IEEE Journal on Selected Areas in Communications.
[18] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[19] Amarendra Mukhopadhyay,et al. Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts , 1963, IEEE Trans. Electron. Comput..