Binary doubly-even self-dual codes of length 72 with large automorphism groups

Binary doubly-even self-dual codes of length 72 with large automorphism groups

We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obt...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical Communications 2013-11, Vol.18 (2), p.297
Hauptverfasser: Crnković, Dean, Rukavina, Sanja, Simčić, Loredana
Format: Artikel
Sprache:eng
Schlagworte:
Hadamard matrix
self-dual code
strongly regular graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 2
container_start_page 297
container_title Mathematical Communications
container_volume 18
creator Crnković, Dean
Rukavina, Sanja
Simčić, Loredana
description We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codes by majority logic decoding. Further, we describe a construction of a strongly regular graph with parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.
format Article
fullrecord <record><control><sourceid>hrcak</sourceid><recordid>TN_cdi_hrcak_primary_oai_hrcak_srce_hr_110820</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_hrcak_srce_hr_110820</sourcerecordid><originalsourceid>FETCH-hrcak_primary_oai_hrcak_srce_hr_1108203</originalsourceid><addsrcrecordid>eNqVjUsKwjAURYMo-N3D20AgaUrNWFEcOXIeYvvaRtOmJI3S3RvQDTg6h8uBOyMrLnNJJeNinlwITlmRiSVZh_BgrOBZXqzI9WB67SeoXLzbieILewhoa1pFbaF0FQZwNVjsm7GFfQZvk2i1bxB0HF3n_NCa0EHjXRzClixqbQPuftwQej7djhfa-lI_1eBNl96U00Z9l-BLTKo4ZzJj4t_-A17xSGE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Binary doubly-even self-dual codes of length 72 with large automorphism groups</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Crnković, Dean ; Rukavina, Sanja ; Simčić, Loredana</creator><creatorcontrib>Crnković, Dean ; Rukavina, Sanja ; Simčić, Loredana</creatorcontrib><description>We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codes by majority logic decoding. Further, we describe a construction of a strongly regular graph with parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.</description><identifier>ISSN: 1331-0623</identifier><identifier>EISSN: 1848-8013</identifier><language>eng</language><publisher>Odjel za matematiku, Sveučilište J.J.Strossmayera u Osijeku</publisher><subject>Hadamard matrix ; self-dual code ; strongly regular graph</subject><ispartof>Mathematical Communications, 2013-11, Vol.18 (2), p.297</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-3299-7859</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,777,781,882</link.rule.ids></links><search><creatorcontrib>Crnković, Dean</creatorcontrib><creatorcontrib>Rukavina, Sanja</creatorcontrib><creatorcontrib>Simčić, Loredana</creatorcontrib><title>Binary doubly-even self-dual codes of length 72 with large automorphism groups</title><title>Mathematical Communications</title><description>We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codes by majority logic decoding. Further, we describe a construction of a strongly regular graph with parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.</description><subject>Hadamard matrix</subject><subject>self-dual code</subject><subject>strongly regular graph</subject><issn>1331-0623</issn><issn>1848-8013</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNqVjUsKwjAURYMo-N3D20AgaUrNWFEcOXIeYvvaRtOmJI3S3RvQDTg6h8uBOyMrLnNJJeNinlwITlmRiSVZh_BgrOBZXqzI9WB67SeoXLzbieILewhoa1pFbaF0FQZwNVjsm7GFfQZvk2i1bxB0HF3n_NCa0EHjXRzClixqbQPuftwQej7djhfa-lI_1eBNl96U00Z9l-BLTKo4ZzJj4t_-A17xSGE</recordid><startdate>20131119</startdate><enddate>20131119</enddate><creator>Crnković, Dean</creator><creator>Rukavina, Sanja</creator><creator>Simčić, Loredana</creator><general>Odjel za matematiku, Sveučilište J.J.Strossmayera u Osijeku</general><scope>VP8</scope><orcidid>https://orcid.org/0000-0002-3299-7859</orcidid></search><sort><creationdate>20131119</creationdate><title>Binary doubly-even self-dual codes of length 72 with large automorphism groups</title><author>Crnković, Dean ; Rukavina, Sanja ; Simčić, Loredana</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-hrcak_primary_oai_hrcak_srce_hr_1108203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Hadamard matrix</topic><topic>self-dual code</topic><topic>strongly regular graph</topic><toplevel>online_resources</toplevel><creatorcontrib>Crnković, Dean</creatorcontrib><creatorcontrib>Rukavina, Sanja</creatorcontrib><creatorcontrib>Simčić, Loredana</creatorcontrib><collection>Hrcak: Portal of scientific journals of Croatia</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Crnković, Dean</au><au>Rukavina, Sanja</au><au>Simčić, Loredana</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Binary doubly-even self-dual codes of length 72 with large automorphism groups</atitle><jtitle>Mathematical Communications</jtitle><date>2013-11-19</date><risdate>2013</risdate><volume>18</volume><issue>2</issue><spage>297</spage><pages>297-</pages><issn>1331-0623</issn><eissn>1848-8013</eissn><abstract>We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codes by majority logic decoding. Further, we describe a construction of a strongly regular graph with parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.</abstract><pub>Odjel za matematiku, Sveučilište J.J.Strossmayera u Osijeku</pub><orcidid>https://orcid.org/0000-0002-3299-7859</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1331-0623
ispartof Mathematical Communications, 2013-11, Vol.18 (2), p.297
issn 1331-0623
1848-8013
language eng
recordid cdi_hrcak_primary_oai_hrcak_srce_hr_110820
source DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Hadamard matrix
self-dual code
strongly regular graph
title Binary doubly-even self-dual codes of length 72 with large automorphism groups
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T12%3A57%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hrcak&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Binary%20doubly-even%20self-dual%20codes%20of%20length%2072%20with%20large%20automorphism%20groups&rft.jtitle=Mathematical%20Communications&rft.au=Crnkovi%C4%87,%20Dean&rft.date=2013-11-19&rft.volume=18&rft.issue=2&rft.spage=297&rft.pages=297-&rft.issn=1331-0623&rft.eissn=1848-8013&rft_id=info:doi/&rft_dat=%3Chrcak%3Eoai_hrcak_srce_hr_110820%3C/hrcak%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