Designs from subcode supports of linear codes |
| |
| Authors: | Thomas Britz Keisuke Shiromoto |
| |
| Institution: | (1) School of Mathematics, University of New South Wales, Sydney, NSW, 2052, Australia;(2) Department of Information Systems, Aichi Prefectural University, Nagakute, Aichi 480-1198, Japan |
| |
| 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.
|
| |
| Keywords: | t-design Linear code Generalized Hamming weight Higher weight enumerator Assmus-Mattson Theorem |
| 本文献已被 SpringerLink 等数据库收录！ |
|
