50,895 research outputs found
Linear Codes from Some 2-Designs
A classical method of constructing a linear code over \gf(q) with a
-design is to use the incidence matrix of the -design as a generator
matrix over \gf(q) of the code. This approach has been extensively
investigated in the literature. In this paper, a different method of
constructing linear codes using specific classes of -designs is studied, and
linear codes with a few weights are obtained from almost difference sets,
difference sets, and a type of -designs associated to semibent functions.
Two families of the codes obtained in this paper are optimal. The linear codes
presented in this paper have applications in secret sharing and authentication
schemes, in addition to their applications in consumer electronics,
communication and data storage systems. A coding-theory approach to the
characterisation of highly nonlinear Boolean functions is presented
MUBs inequivalence and affine planes
There are fairly large families of unitarily inequivalent complete sets of
N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The
number of such sets is not bounded above by any polynomial as a function of N.
While it is standard that there is a superficial similarity between complete
sets of MUBs and finite affine planes, there is an intimate relationship
between these large families and affine planes. This note briefly summarizes
"old" results that do not appear to be well-known concerning known families of
complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical
Physics 53, 032204 (2012) except for format changes due to the journal's
style policie
- …