4,591 research outputs found
Kerdock Codes Determine Unitary 2-Designs
The non-linear binary Kerdock codes are known to be Gray images of certain
extended cyclic codes of length over . We show that
exponentiating these -valued codewords by produces stabilizer states, that are quantum states obtained using
only Clifford unitaries. These states are also the common eigenvectors of
commuting Hermitian matrices forming maximal commutative subgroups (MCS) of the
Pauli group. We use this quantum description to simplify the derivation of the
classical weight distribution of Kerdock codes. Next, we organize the
stabilizer states to form mutually unbiased bases and prove that
automorphisms of the Kerdock code permute their corresponding MCS, thereby
forming a subgroup of the Clifford group. When represented as symplectic
matrices, this subgroup is isomorphic to the projective special linear group
PSL(). We show that this automorphism group acts transitively on the Pauli
matrices, which implies that the ensemble is Pauli mixing and hence forms a
unitary -design. The Kerdock design described here was originally discovered
by Cleve et al. (arXiv:1501.04592), but the connection to classical codes is
new which simplifies its description and translation to circuits significantly.
Sampling from the design is straightforward, the translation to circuits uses
only Clifford gates, and the process does not require ancillary qubits.
Finally, we also develop algorithms for optimizing the synthesis of unitary
-designs on encoded qubits, i.e., to construct logical unitary -designs.
Software implementations are available at
https://github.com/nrenga/symplectic-arxiv18a, which we use to provide
empirical gate complexities for up to qubits.Comment: 16 pages double-column, 4 figures, and some circuits. Accepted to
2019 Intl. Symp. Inf. Theory (ISIT), and PDF of the 5-page ISIT version is
included in the arXiv packag
Self-Dual Codes
Self-dual codes are important because many of the best codes known are of
this type and they have a rich mathematical theory. Topics covered in this
survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight
enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems,
bounds, mass formulae, enumeration, extremal codes, open problems. There is a
comprehensive bibliography.Comment: 136 page
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
"Extended Clifford algebras" are introduced as a means to obtain low ML
decoding complexity space-time block codes. Using left regular matrix
representations of two specific classes of extended Clifford algebras, two
systematic algebraic constructions of full diversity Distributed Space-Time
Codes (DSTCs) are provided for any power of two number of relays. The left
regular matrix representation has been shown to naturally result in space-time
codes meeting the additional constraints required for DSTCs. The DSTCs so
constructed have the salient feature of reduced Maximum Likelihood (ML)
decoding complexity. In particular, the ML decoding of these codes can be
performed by applying the lattice decoder algorithm on a lattice of four times
lesser dimension than what is required in general. Moreover these codes have a
uniform distribution of power among the relays and in time, thus leading to a
low Peak to Average Power Ratio at the relays.Comment: 5 pages, no figures. To appear in Proceedings of IEEE ISIT 2007,
Nice, Franc
Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
H. Cohn et. al. proposed an association scheme of 64 points in R^{14} which
is conjectured to be a universally optimal code. We show that this scheme has a
generalization in terms of Kerdock codes, as well as in terms of maximal real
mutually unbiased bases. These schemes also related to extremal line-sets in
Euclidean spaces and Barnes-Wall lattices. D. de Caen and E. R. van Dam
constructed two infinite series of formally dual 3-class association schemes.
We explain this formal duality by constructing two dual abelian schemes related
to quaternary linear Kerdock and Preparata codes.Comment: 16 page
Quarter-fraction factorial designs constructed via quaternary codes
The research of developing a general methodology for the construction of good
nonregular designs has been very active in the last decade. Recent research by
Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of
nonregular designs constructed from quaternary codes. This paper explores the
properties and uses of quaternary codes toward the construction of
quarter-fraction nonregular designs. Some theoretical results are obtained
regarding the aliasing structure of such designs. Optimal designs are
constructed under the maximum resolution, minimum aberration and maximum
projectivity criteria. These designs often have larger generalized resolution
and larger projectivity than regular designs of the same size. It is further
shown that some of these designs have generalized minimum aberration and
maximum projectivity among all possible designs.Comment: Published in at http://dx.doi.org/10.1214/08-AOS656 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
Coding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding
theory and algebraic combinatorics, with most of the focus on the interaction
of codes with combinatorial designs, finite geometries, simple groups, sphere
packings, kissing numbers, lattices, and association schemes. In particular,
special interest is devoted to the relationship between codes and combinatorial
designs. We describe and recapitulate important results in the development of
the state of the art. In addition, we give illustrative examples and
constructions, and highlight recent advances. Finally, we provide a collection
of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in
Information and Coding Theory", ed. by I. Woungang et al., World Scientific,
Singapore, 201
- …