activity
20102026
most citedOn the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method

9 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2026

An Algebraic Method for Full-Rank Characterization in Binary Linear Coding

Mingyang Zhu, Laigang Guo, Zhenyu Huang +4

In this paper, we develop a characteristic set (CS)-based method for deriving full-rank equivalence conditions of symbolic matrices over the binary field. Such full-rank conditions…

cs.SC2014

A Monomial-Oriented GVW for Computing Gröbner Bases

Yao Sun, Dingkang Wang, Zhenyu Huang +1

The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a…

cs.SC2014★ 9 cited

On the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method

Zhenyu Huang, Yao Sun, Dongdai Lin

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones b…

cs.SC2014★ 4 cited

An Improvement over the GVW Algorithm for Inhomogeneous Polynomial Systems

Yao Sun, Dongdai Lin, Dingkang Wang

The GVW algorithm is a signature-based algorithm for computing Gröbner bases. If the input system is not homogeneous, some J-pairs with higher signatures but lower degrees are reje…

cs.SC2010★ 2 cited

Efficient Characteristic Set Algorithms for Equation Solving in Finite Fields and Applications in Cryptanalysis

Xiao-Shan Gao, Zhenyu Huang

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and…