On binary codes related to mutually quasi-unbiased weighing matrices
classification
🧮 math.CO
keywords
binarycodesconditionsmatricesmutuallyquasi-unbiasedsatisfyingweighing
read the original abstract
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give a classification of binary codes of lengths $8,16$ and binary maximal codes of length $32$ satisfying the conditions. As an application, sets of $8$ mutually quasi-unbiased weighing matrices for parameters $(16,16,4,64)$ and $4$ mutually quasi-unbiased weighing matrices for parameters $(32,32,4,256)$ are constructed for the first time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.