A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.
On the efficiency of solving boolean polynomial systems with the characteristic set method
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
An Algebraic Method for Full-Rank Characterization in Binary Linear Coding
A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.