Abstract | ||
---|---|---|
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 F"4, 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"4. 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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.jsc.2010.03.011 | J. Symb. Comput. |
Keywords | DocType | Volume |
great interest,near-extremal code,self-dual linear code,Near-extremal codes,formally self-dual additive codes,Balance principle,additive codes,self-dual additive code,natural analogue,error correction,extremal codes,Formally self-dual additive codes,additive code,extremal code,self-dual code,Extremal codes,Additive codes,near- extremal codes,general method | Journal | 45 |
Issue | ISSN | Citations |
7 | Journal of Symbolic Computation | 7 |
PageRank | References | Authors |
0.66 | 15 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sunghyu Han | 1 | 35 | 6.52 |
Jon-Lark Kim | 2 | 312 | 34.62 |