{"title":"On an Assmus–Mattson type theorem for type I and even formally self-dual codes","authors":"Tsuyoshi Miezaki, Hiroyuki Nakasora","doi":"10.1002/jcd.21883","DOIUrl":null,"url":null,"abstract":"<p>In the present paper, we give an Assmus–Mattson type theorem for near-extremal Type I and even formally self-dual codes. We show the existence of 1-designs or 2-designs for these codes. As a corollary, we prove the uniqueness of a self-orthogonal 2-<math>\n <semantics>\n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mn>16</mn>\n \n <mo>,</mo>\n \n <mn>6</mn>\n \n <mo>,</mo>\n \n <mn>8</mn>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n <annotation> $(16,6,8)$</annotation>\n </semantics></math> design.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"31 7","pages":"335-344"},"PeriodicalIF":0.5000,"publicationDate":"2023-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21883","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 7
Abstract
In the present paper, we give an Assmus–Mattson type theorem for near-extremal Type I and even formally self-dual codes. We show the existence of 1-designs or 2-designs for these codes. As a corollary, we prove the uniqueness of a self-orthogonal 2- design.
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.