Linear programming bounds for doubly-even self-dual codes

被引：0

|

作者：

Tel-Aviv Univ, Tel-Aviv, Israel ^{[1
]}

机构：

来源：

IEEE Trans Inf Theory | / 4卷 / 1238-1244期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[11] New extremal self-dual doubly-even binary codes of length 88
Goodwin, V
Yorov, V
FINITE FIELDS AND THEIR APPLICATIONS, 2005, 11 (01) : 1 - 5
[12] Binary doubly-even self-dual codes of length 72 with large automorphism groups
Crnkovic, Dean
Rukavina, Sanja
Simcic, Loredana
MATHEMATICAL COMMUNICATIONS, 2013, 18 (02) : 297 - 308
[13] Decoding some doubly-even self-dual [32,16,8] codes by hand
Kim, JL
Pless, V
CODES AND DESIGNS, 2002, 10 : 165 - 178
[14] The third support weight enumerators of the doubly-even, self-dual [32,16,8] codes
Milenkovic, O
Coffey, ST
Compton, KJ
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (03) : 740 - 746
[15] Automorphisms of doubly even self-dual binary codes
Guenther, Annika
Nebe, Gabriele
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2009, 41 : 769 - 778
[16] ON SELF-DUAL, DOUBLY EVEN CODES OF LENGTH-32
KOCH, H
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1989, 51 (01) : 63 - 76
[17] On the covering radii of extremal doubly even self-dual codes
Harada, Masaaki
Munemasa, Akihiro
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2007, 1 (02) : 251 - 256
[18] A Characterization of Designs Related to an Extremal Doubly-Even Self-Dual Code of Length 48
Masaaki Harada
Akihiro Munemasa
Vladimir D. Tonchev
Annals of Combinatorics, 2005, 9 : 189 - 198
[19] Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes
Jianying Fang
Yanxun Chang
Designs, Codes and Cryptography, 2014, 73 : 769 - 780
[20] Mutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes
Fang, Jianying
Chang, Yanxun
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (03) : 769 - 780

← 1 2 3 4 5 →