{"paper":{"title":"On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Danilo Gligoroski, Katina Kralevska, Kristian Gjosteen","submitted_at":"2018-01-20T22:19:40Z","abstract_excerpt":"Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this paper, we introduce a new family of matrices over finite fields that we call \\emph{Quasi-Binary and Quasi-Orthogonal Matrices}. We call the matrices quasi-binary due to the fact that matrices have only two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06736","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}