Formally self-dual additive codes over F4

Citations

WEB OF SCIENCE

8
Citations

SCOPUS

9

초록

Additive codes over F-4 have been of great interest due to their application to quantum error correction. As another application, we introduce a new class of formally self-dual additive codes over Fa, which is a natural analogue of the binary formally self-dual codes and is missing in the study of additive codes over F-4. In fact, Gulliver and Ostergard (2003) considered formally self-dual linear codes over F-4 of even lengths, and Choie and Sole (2008) suggested classifying formally self-dual linear codes over F-4 of odd lengths in order to study lattices from these codes. These motivate our study on formally self-dual additive codes over F. In this paper, we define extremal and near-extremal formally self-dual additive codes over F-4, classify all extremal codes, and construct many near-extremal codes. We discuss a general method (called the weak balance principle) for constructing such codes. We conclude with some open problems. (C) 2010 Elsevier Ltd. All rights reserved.

키워드

Additive codesBalance principleExtremal codesFormally self-dual additive codesNear-extremal codesCLASSIFICATIONLENGTHBOUNDS
제목
Formally self-dual additive codes over F4
저자
Han, SunghyuKim, Jon-Lark
DOI
10.1016/j.jsc.2010.03.011
발행일
2010-07
유형
Article
저널명
Journal of Symbolic Computation
45
7
페이지
787 ~ 799