515 research outputs found
Framed vertex operator algebras, codes and the moonshine module
For a simple vertex operator algebra whose Virasoro element is a sum of
commutative Virasoro elements of central charge 1/2, two codes are introduced
and studied. It is proved that such vertex operator algebras are rational. For
lattice vertex operator algebras and related ones, decompositions into direct
sums of irreducible modules for the product of the Virasoro algebras of central
charge 1/2 are explicitly described. As an application, the decomposition of
the moonshine vertex operator algebra is obtained for a distinguished system of
48 Virasoro algebras.Comment: Latex, 54 page
An -approach to the moonshine vertex operator algebra
In this article, we study the moonshine vertex operator algebra starting with
the tensor product of three copies of the vertex operator algebra
, and describe it by the quadratic space over \F_2
associated to . Using quadratic spaces and orthogonal groups,
we show the transitivity of the automorphism group of the moonshine vertex
operator algebra on the set of all full vertex operator subalgebras isomorphic
to the tensor product of three copies of , and determine the
stabilizer of such a vertex operator subalgebra. Our approach is a vertex
operator algebra analogue of "An -approach to the Leech lattice and the
Conway group" by Lepowsky and Meurman. Moreover, we find new analogies among
the moonshine vertex operator algebra, the Leech lattice and the extended
binary Golay code.Comment: 25 page
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
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
Conformal Field Theories, Representations and Lattice Constructions
An account is given of the structure and representations of chiral bosonic
meromorphic conformal field theories (CFT's), and, in particular, the
conditions under which such a CFT may be extended by a representation to form a
new theory. This general approach is illustrated by considering the untwisted
and -twisted theories, and respectively,
which may be constructed from a suitable even Euclidean lattice .
Similarly, one may construct lattices and by
analogous constructions from a doubly-even binary code . In the case when
is self-dual, the corresponding lattices are also. Similarly,
and are self-dual if and only if is. We show that
has a natural ``triality'' structure, which induces an
isomorphism and also a triality
structure on . For the Golay code,
is the Leech lattice, and the triality on is the symmetry which extends the natural action of (an
extension of) Conway's group on this theory to the Monster, so setting triality
and Frenkel, Lepowsky and Meurman's construction of the natural Monster module
in a more general context. The results also serve to shed some light on the
classification of self-dual CFT's. We find that of the 48 theories
and with central charge 24 that there are 39 distinct ones,
and further that all 9 coincidences are accounted for by the isomorphism
detailed above, induced by the existence of a doubly-even self-dual binary
code.Comment: 65 page
Some partial-unit-memory convolutional codes
The results of a study on a class of error correcting codes called partial unit memory (PUM) codes are presented. This class of codes, though not entirely new, has until now remained relatively unexplored. The possibility of using the well developed theory of block codes to construct a large family of promising PUM codes is shown. The performance of several specific PUM codes are compared with that of the Voyager standard (2, 1, 6) convolutional code. It was found that these codes can outperform the Voyager code with little or no increase in decoder complexity. This suggests that there may very well be PUM codes that can be used for deep space telemetry that offer both increased performance and decreased implementational complexity over current coding systems
- …