Kneser— Hecke— operators in coding theory
✍ Scribed by G. Nebe
- Publisher
- Vandenhoeck & Ruprecht
- Year
- 2006
- Tongue
- German
- Weight
- 453 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0025-5858
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We study the representation theory of code vertex operator algebras M D Ž . VOAs constructed from an even binary linear code D. Our main purpose is to study, using the representation theory of M , the structure of VOA V containing a D 1 set of mutually orthogonal rational conformal vectors with cent
We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of