Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes
In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$, there exists a super-simple $(v,5,2)$ directed design, also for these parameters there exists a super-simple $(v,5,2)$ directed design such that its smallest defining sets contain at least half of its blocks. Also, we show tha...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| 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 | Mohammadnezhad, M Golalizadeh, S Boostan, M Soltankhah, N |
| description | In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$,
there exists a super-simple $(v,5,2)$ directed design, also for these
parameters there exists a super-simple $(v,5,2)$ directed design such that its
smallest defining sets contain at least half of its blocks. Also, we show that
these designs are useful in constructing parity-check matrices of LDPC codes. |
| doi_str_mv | 10.48550/arxiv.2007.13743 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_13743</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_13743</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-8564495797986e1ed6b74134b7e40bf0c99fda1ff2a3b1c49f8c72735bd359203</originalsourceid><addsrcrecordid>eNotj8tKxDAYRrNxIaMP4MosZqEwHZMmaZql1CsUFJx9SXOZ-bHNlCSO-vbW0dV34IMDB6ELSta8FoLc6PgFh3VJiFxTJjk7Re9vH5OLRYJxGhxeXh1WYlVeL7GF6Ex2FluXYBsS1sHivHMQcRr1MLiU58tDgLDFyeWEPyHvMMygp2kAozPsA4aA27vXBpv97DlDJ14PyZ3_7wJtHu43zVPRvjw-N7dtoSvJilpUnCshlVR15aizVS85ZbyXjpPeE6OUt5p6X2rWU8OVr40sJRO9ZUKVhC3Q5Z_2WNtNEUYdv7vf6u5YzX4Ab2VRXA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes</title><source>arXiv.org</source><creator>Mohammadnezhad, M ; Golalizadeh, S ; Boostan, M ; Soltankhah, N</creator><creatorcontrib>Mohammadnezhad, M ; Golalizadeh, S ; Boostan, M ; Soltankhah, N</creatorcontrib><description>In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$,
there exists a super-simple $(v,5,2)$ directed design, also for these
parameters there exists a super-simple $(v,5,2)$ directed design such that its
smallest defining sets contain at least half of its blocks. Also, we show that
these designs are useful in constructing parity-check matrices of LDPC codes.</description><identifier>DOI: 10.48550/arxiv.2007.13743</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-07</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,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2007.13743$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.13743$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mohammadnezhad, M</creatorcontrib><creatorcontrib>Golalizadeh, S</creatorcontrib><creatorcontrib>Boostan, M</creatorcontrib><creatorcontrib>Soltankhah, N</creatorcontrib><title>Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes</title><description>In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$,
there exists a super-simple $(v,5,2)$ directed design, also for these
parameters there exists a super-simple $(v,5,2)$ directed design such that its
smallest defining sets contain at least half of its blocks. Also, we show that
these designs are useful in constructing parity-check matrices of LDPC codes.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tKxDAYRrNxIaMP4MosZqEwHZMmaZql1CsUFJx9SXOZ-bHNlCSO-vbW0dV34IMDB6ELSta8FoLc6PgFh3VJiFxTJjk7Re9vH5OLRYJxGhxeXh1WYlVeL7GF6Ex2FluXYBsS1sHivHMQcRr1MLiU58tDgLDFyeWEPyHvMMygp2kAozPsA4aA27vXBpv97DlDJ14PyZ3_7wJtHu43zVPRvjw-N7dtoSvJilpUnCshlVR15aizVS85ZbyXjpPeE6OUt5p6X2rWU8OVr40sJRO9ZUKVhC3Q5Z_2WNtNEUYdv7vf6u5YzX4Ab2VRXA</recordid><startdate>20200727</startdate><enddate>20200727</enddate><creator>Mohammadnezhad, M</creator><creator>Golalizadeh, S</creator><creator>Boostan, M</creator><creator>Soltankhah, N</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200727</creationdate><title>Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes</title><author>Mohammadnezhad, M ; Golalizadeh, S ; Boostan, M ; Soltankhah, N</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-8564495797986e1ed6b74134b7e40bf0c99fda1ff2a3b1c49f8c72735bd359203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Mohammadnezhad, M</creatorcontrib><creatorcontrib>Golalizadeh, S</creatorcontrib><creatorcontrib>Boostan, M</creatorcontrib><creatorcontrib>Soltankhah, N</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mohammadnezhad, M</au><au>Golalizadeh, S</au><au>Boostan, M</au><au>Soltankhah, N</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes</atitle><date>2020-07-27</date><risdate>2020</risdate><abstract>In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$,
there exists a super-simple $(v,5,2)$ directed design, also for these
parameters there exists a super-simple $(v,5,2)$ directed design such that its
smallest defining sets contain at least half of its blocks. Also, we show that
these designs are useful in constructing parity-check matrices of LDPC codes.</abstract><doi>10.48550/arxiv.2007.13743</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2007.13743 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2007_13743 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Super-simple $(v,5,2)$ directed designs and their smallest defining sets with its application in LDPC codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T10%3A50%3A46IST&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=Super-simple%20$(v,5,2)$%20directed%20designs%20and%20their%20smallest%20defining%20sets%20with%20its%20application%20in%20LDPC%20codes&rft.au=Mohammadnezhad,%20M&rft.date=2020-07-27&rft_id=info:doi/10.48550/arxiv.2007.13743&rft_dat=%3Carxiv_GOX%3E2007_13743%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 |