Semi-canonical binary matrices

June 15, 2015 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Krasimir Yordzhev arXiv ID 1506.04642 Category math.CO: Combinatorics Cross-listed cs.DM, cs.DS Citations 2 Venue arXiv.org Last Checked 3 months ago
Abstract
In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all semi-canonical binary matrices taking into account the number of 1 in each of them. This problem relates to the combinatorial problem of finding all pairs of disjoint S-permutation matrices. In the described algorithm, the bit-wise operations are substantially used.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Combinatorics

🔮 🔮 The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO 🏛 arXiv 📚 94 cites 10 years ago