On the Assmus--Mattson type theorem for Type I and even formally self-dual codes

In the present paper, we give the 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$-$(16,6,8)$ design.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Miezaki, Tsuyoshi, Nakasora, Hiroyuki
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Miezaki, Tsuyoshi
Nakasora, Hiroyuki
description In the present paper, we give the 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$-$(16,6,8)$ design.
doi_str_mv 10.48550/arxiv.2208.08617
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2208_08617</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2208_08617</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-631d765f6f56b2b32be4a7a10937361b035e6f56270e3e7a0063867c6c5772e53</originalsourceid><addsrcrecordid>eNotj8tqwzAQRbXpoqT9gK6qH5CrRzTjLkPoI5CSLrw3Y3tEA7IdJCfUf9867erCOXDhCPFgdLEuvddPlL6Pl8JaXRa6BIO34vMwyOmL5Sbn_pyV-qBpyuMvm0-8iDFxL8OYZLWAnaShk3zhYWE9xTjLzDGo7kxRtmPH-U7cBIqZ7_93JarXl2r7rvaHt912s1cEiAqc6RB8gOChsY2zDa8Jyehnhw5Mo53nxVnU7BhJa3AlYAutR7Ts3Uo8_t1ek-pTOvaU5npJq69p7gdz2ke3</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Assmus--Mattson type theorem for Type I and even formally self-dual codes</title><source>arXiv.org</source><creator>Miezaki, Tsuyoshi ; Nakasora, Hiroyuki</creator><creatorcontrib>Miezaki, Tsuyoshi ; Nakasora, Hiroyuki</creatorcontrib><description>In the present paper, we give the 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$-$(16,6,8)$ design.</description><identifier>DOI: 10.48550/arxiv.2208.08617</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Combinatorics ; Mathematics - Group Theory ; Mathematics - Information Theory</subject><creationdate>2022-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2208.08617$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2208.08617$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Miezaki, Tsuyoshi</creatorcontrib><creatorcontrib>Nakasora, Hiroyuki</creatorcontrib><title>On the Assmus--Mattson type theorem for Type I and even formally self-dual codes</title><description>In the present paper, we give the 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$-$(16,6,8)$ design.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Group Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tqwzAQRbXpoqT9gK6qH5CrRzTjLkPoI5CSLrw3Y3tEA7IdJCfUf9867erCOXDhCPFgdLEuvddPlL6Pl8JaXRa6BIO34vMwyOmL5Sbn_pyV-qBpyuMvm0-8iDFxL8OYZLWAnaShk3zhYWE9xTjLzDGo7kxRtmPH-U7cBIqZ7_93JarXl2r7rvaHt912s1cEiAqc6RB8gOChsY2zDa8Jyehnhw5Mo53nxVnU7BhJa3AlYAutR7Ts3Uo8_t1ek-pTOvaU5npJq69p7gdz2ke3</recordid><startdate>20220817</startdate><enddate>20220817</enddate><creator>Miezaki, Tsuyoshi</creator><creator>Nakasora, Hiroyuki</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220817</creationdate><title>On the Assmus--Mattson type theorem for Type I and even formally self-dual codes</title><author>Miezaki, Tsuyoshi ; Nakasora, Hiroyuki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-631d765f6f56b2b32be4a7a10937361b035e6f56270e3e7a0063867c6c5772e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Group Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Miezaki, Tsuyoshi</creatorcontrib><creatorcontrib>Nakasora, Hiroyuki</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Miezaki, Tsuyoshi</au><au>Nakasora, Hiroyuki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Assmus--Mattson type theorem for Type I and even formally self-dual codes</atitle><date>2022-08-17</date><risdate>2022</risdate><abstract>In the present paper, we give the 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$-$(16,6,8)$ design.</abstract><doi>10.48550/arxiv.2208.08617</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2208.08617
ispartof
issn
language eng
recordid cdi_arxiv_primary_2208_08617
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Combinatorics
Mathematics - Group Theory
Mathematics - Information Theory
title On the Assmus--Mattson type theorem for Type I and even formally self-dual codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T06%3A40%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Assmus--Mattson%20type%20theorem%20for%20Type%20I%20and%20even%20formally%20self-dual%20codes&rft.au=Miezaki,%20Tsuyoshi&rft.date=2022-08-17&rft_id=info:doi/10.48550/arxiv.2208.08617&rft_dat=%3Carxiv_GOX%3E2208_08617%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true