English

On binary codes related to mutually quasi-unbiased weighing matrices

Combinatorics 2016-08-19 v3

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,168,16 and binary maximal codes of length 3232 satisfying the conditions. As an application, sets of 88 mutually quasi-unbiased weighing matrices for parameters (16,16,4,64)(16,16,4,64) and 44 mutually quasi-unbiased weighing matrices for parameters (32,32,4,256)(32,32,4,256) are constructed for the first time.

Keywords

Cite

@article{arxiv.1504.03502,
  title  = {On binary codes related to mutually quasi-unbiased weighing matrices},
  author = {Masaaki Harada and Sho Suda},
  journal= {arXiv preprint arXiv:1504.03502},
  year   = {2016}
}

Comments

14 pages

R2 v1 2026-06-22T09:15:42.374Z