Designs from subcode supports of linear codes

Authors:
Thomas Britz;Keisuke Shiromoto
Affiliations:
School of Mathematics, University of New South Wales, Sydney, Australia 2052;Department of Information Systems, Aichi Prefectural University, Nagakute, Aichi, Japan 480-1198
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 9
Cited 1

On self-dual, doubly even codes of length 32

Journal of Combinatorial Theory Series A
Handbook of Coding Theory

Handbook of Coding Theory
The Weight Enumerator of Linear Codes over GF (q^m) Having Generator Matrix over GF (q)

Designs, Codes and Cryptography
Designs in Additive Codes over GF(4)

Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Geometric approach to higher weights

IEEE Transactions on Information Theory - Part 1
The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code

IEEE Transactions on Information Theory
The third support weight enumerators of the doubly-even, self-dual [32,16,8] codes

IEEE Transactions on Information Theory
The Higher Weight Enumerators of the Doubly-Even, Self-Dual [48, 24, 12] Code

IEEE Transactions on Information Theory

Code enumerators and tutte polynomials

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We present new constructions of t-designs by considering subcode supports of linear codes over finite fields. In particular, we prove an Assmus-Mattson type theorem for such subcodes, as well as an automorphism characterization. We derive new t-designs (t 驴 5) from our constructions.