Finding the minimum distance and decoding linear codes with Gaussian Elimination Method
We propose an algorithm using the Gaussian elimination method to find the minimal Hamming distance and decode received messages of linear codes. This algorithm is easy to implement as it requires no Gr\"obner bases to compute solutions for systems of polynomial equations
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | Yang, Tianshuo |
| description | We propose an algorithm using the Gaussian elimination method to find the
minimal Hamming distance and decode received messages of linear codes. This
algorithm is easy to implement as it requires no Gr\"obner bases to compute
solutions for systems of polynomial equations |
| doi_str_mv | 10.48550/arxiv.2303.06889 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2303_06889</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2303_06889</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-adb214dc9ea8d51d8b50a7e796451c615077001a4393c4fc860fb406228990043</originalsourceid><addsrcrecordid>eNotj8tOwzAURL1hgQofwAr_QMJ1_Ii9RFVbkIq6qcQyurEdcqXEQUnawt9TAqvRSHNGOow9CMiV1RqecPyic15IkDkYa90te99SCpQ--NxG3lOi_tTzQNOMyUeOKfAQ_bAsOkoRR35tceIXmlu-w9M0ESa-6ejK4kxD4m9xbodwx24a7KZ4_58rdtxujuuXbH_Yva6f9xma0mUY6kKo4F1EG7QIttaAZSydUVp4IzSUJYBAJZ30qvHWQFMrMEVhnQNQcsUe_24Xs-pzpB7H7-rXsFoM5Q-xJEtq</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Finding the minimum distance and decoding linear codes with Gaussian Elimination Method</title><source>arXiv.org</source><creator>Yang, Tianshuo</creator><creatorcontrib>Yang, Tianshuo</creatorcontrib><description>We propose an algorithm using the Gaussian elimination method to find the
minimal Hamming distance and decode received messages of linear codes. This
algorithm is easy to implement as it requires no Gr\"obner bases to compute
solutions for systems of polynomial equations</description><identifier>DOI: 10.48550/arxiv.2303.06889</identifier><language>eng</language><subject>Computer Science - Cryptography and Security ; Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2023-03</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/2303.06889$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2303.06889$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yang, Tianshuo</creatorcontrib><title>Finding the minimum distance and decoding linear codes with Gaussian Elimination Method</title><description>We propose an algorithm using the Gaussian elimination method to find the
minimal Hamming distance and decode received messages of linear codes. This
algorithm is easy to implement as it requires no Gr\"obner bases to compute
solutions for systems of polynomial equations</description><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURL1hgQofwAr_QMJ1_Ii9RFVbkIq6qcQyurEdcqXEQUnawt9TAqvRSHNGOow9CMiV1RqecPyic15IkDkYa90te99SCpQ--NxG3lOi_tTzQNOMyUeOKfAQ_bAsOkoRR35tceIXmlu-w9M0ESa-6ejK4kxD4m9xbodwx24a7KZ4_58rdtxujuuXbH_Yva6f9xma0mUY6kKo4F1EG7QIttaAZSydUVp4IzSUJYBAJZ30qvHWQFMrMEVhnQNQcsUe_24Xs-pzpB7H7-rXsFoM5Q-xJEtq</recordid><startdate>20230313</startdate><enddate>20230313</enddate><creator>Yang, Tianshuo</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230313</creationdate><title>Finding the minimum distance and decoding linear codes with Gaussian Elimination Method</title><author>Yang, Tianshuo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-adb214dc9ea8d51d8b50a7e796451c615077001a4393c4fc860fb406228990043</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Yang, Tianshuo</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>Yang, Tianshuo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finding the minimum distance and decoding linear codes with Gaussian Elimination Method</atitle><date>2023-03-13</date><risdate>2023</risdate><abstract>We propose an algorithm using the Gaussian elimination method to find the
minimal Hamming distance and decode received messages of linear codes. This
algorithm is easy to implement as it requires no Gr\"obner bases to compute
solutions for systems of polynomial equations</abstract><doi>10.48550/arxiv.2303.06889</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2303.06889 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2303_06889 |
| source | arXiv.org |
| subjects | Computer Science - Cryptography and Security Computer Science - Information Theory Mathematics - Information Theory |
| title | Finding the minimum distance and decoding linear codes with Gaussian Elimination Method |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T19%3A09%3A16IST&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=Finding%20the%20minimum%20distance%20and%20decoding%20linear%20codes%20with%20Gaussian%20Elimination%20Method&rft.au=Yang,%20Tianshuo&rft.date=2023-03-13&rft_id=info:doi/10.48550/arxiv.2303.06889&rft_dat=%3Carxiv_GOX%3E2303_06889%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 |