Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\)
Let \(p\) be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length \(2p^s\) over the finite commutative non-chain ring \(\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\). Also their symbol-pair distances are completely obtai...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2024-12 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Acharya, Divya Poojary, Prasanna Vadiraja, Bhatta G |
| description | Let \(p\) be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length \(2p^s\) over the finite commutative non-chain ring \(\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\). Also their symbol-pair distances are completely obtained. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3148681276</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3148681276</sourcerecordid><originalsourceid>FETCH-proquest_journals_31486812763</originalsourceid><addsrcrecordid>eNqNit9qwjAchcNgoGy-ww-8mbBCm2jtvZt44YWw3S1rSWNaK_nTJU1BSh_CN17m9gC7OYfvO-cOTTEhSZQtMZ6gmXPnOI5xusarFZmi644p1egamD7C20WVRkYH1lh4aVzHNBcOTAUbowPxC5cND3D8tXuh6-4E9Am3uaMLML2wgWhlGR-oYt2pLIftWAxtrsYP_wz95zhQyXQtBfgcB_ETvo96T-1Nj3TxiO4rJp2Y_fUDmm9f3ze7qLXmywvXFWfjrQ5TQZJllmYJXqfkf69vMwFViA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3148681276</pqid></control><display><type>article</type><title>Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\)</title><source>Free E- Journals</source><creator>Acharya, Divya ; Poojary, Prasanna ; Vadiraja, Bhatta G</creator><creatorcontrib>Acharya, Divya ; Poojary, Prasanna ; Vadiraja, Bhatta G</creatorcontrib><description>Let \(p\) be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length \(2p^s\) over the finite commutative non-chain ring \(\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\). Also their symbol-pair distances are completely obtained.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><ispartof>arXiv.org, 2024-12</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>776,780</link.rule.ids></links><search><creatorcontrib>Acharya, Divya</creatorcontrib><creatorcontrib>Poojary, Prasanna</creatorcontrib><creatorcontrib>Vadiraja, Bhatta G</creatorcontrib><title>Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\)</title><title>arXiv.org</title><description>Let \(p\) be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length \(2p^s\) over the finite commutative non-chain ring \(\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\). Also their symbol-pair distances are completely obtained.</description><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNit9qwjAchcNgoGy-ww-8mbBCm2jtvZt44YWw3S1rSWNaK_nTJU1BSh_CN17m9gC7OYfvO-cOTTEhSZQtMZ6gmXPnOI5xusarFZmi644p1egamD7C20WVRkYH1lh4aVzHNBcOTAUbowPxC5cND3D8tXuh6-4E9Am3uaMLML2wgWhlGR-oYt2pLIftWAxtrsYP_wz95zhQyXQtBfgcB_ETvo96T-1Nj3TxiO4rJp2Y_fUDmm9f3ze7qLXmywvXFWfjrQ5TQZJllmYJXqfkf69vMwFViA</recordid><startdate>20241220</startdate><enddate>20241220</enddate><creator>Acharya, Divya</creator><creator>Poojary, Prasanna</creator><creator>Vadiraja, Bhatta G</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20241220</creationdate><title>Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\)</title><author>Acharya, Divya ; Poojary, Prasanna ; Vadiraja, Bhatta G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_31486812763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Acharya, Divya</creatorcontrib><creatorcontrib>Poojary, Prasanna</creatorcontrib><creatorcontrib>Vadiraja, Bhatta G</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Acharya, Divya</au><au>Poojary, Prasanna</au><au>Vadiraja, Bhatta G</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\)</atitle><jtitle>arXiv.org</jtitle><date>2024-12-20</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Let \(p\) be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length \(2p^s\) over the finite commutative non-chain ring \(\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\). Also their symbol-pair distances are completely obtained.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2024-12 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_3148681276 |
| source | Free E- Journals |
| title | Hamming and Symbol-Pair Distances of Constacyclic Codes of Length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}\) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T15%3A01%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Hamming%20and%20Symbol-Pair%20Distances%20of%20Constacyclic%20Codes%20of%20Length%20%5C(2p%5Es%5C)%20over%20%5C(%5Cfrac%7B%5Cmathbb%7BF%7D_%7Bp%5Em%7D%5Bu,%20v%5D%7D%7B%5Clangle%20u%5E2,%20v%5E2,%20uv-vu%5Crangle%7D%5C)&rft.jtitle=arXiv.org&rft.au=Acharya,%20Divya&rft.date=2024-12-20&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3148681276%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3148681276&rft_id=info:pmid/&rfr_iscdi=true |