On binary codes related to mutually quasi-unbiased weighing matrices

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.