A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes
We present an efficient construction of extended length Goppa codes. Using this construction, we obtain 78 new nonbinary codes with better minimum distance than the previously known codes with the same length and dimension. The construction is based on the observation that certain Goppa codes can be...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2013-11, Vol.59 (11), p.7299-7304 |
|---|---|
| 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 | 7304 |
|---|---|
| container_issue | 11 |
| container_start_page | 7299 |
| container_title | IEEE transactions on information theory |
| container_volume | 59 |
| creator | Tomlinson, Martin Jibril, Mubarak Tjhai, Cen Bezzateev, Sergey V. Grassl, Markus Ahmed, Mohammed Zaki |
| description | We present an efficient construction of extended length Goppa codes. Using this construction, we obtain 78 new nonbinary codes with better minimum distance than the previously known codes with the same length and dimension. The construction is based on the observation that certain Goppa codes can be seen as BCH codes. |
| doi_str_mv | 10.1109/TIT.2013.2276626 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6574242</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6574242</ieee_id><sourcerecordid>3107969951</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-6090d77b981c57d491b353e2bda51cb7cb9cf90d0d61bf243de481c3373fabf63</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt3wcuC5635TnMsxdZCsZd6Dvla2NJN1mQr6K83ZUtPwwzPzLw8ADwjOEMIyrf9Zj_DEJEZxoJzzG_ABDEmaskZvQUTCNG8lpTO78FDzofSUobwBOwW1doHn_Sx_fOuWsaQh3SyQxtDpYOrNl2f4o_vfBhyVWafMZg26PRbUOdztUqxq9ax7_U4eAR3jT5m_3SpU_C1et8vP-rtbr1ZLra1xRINNYcSOiGMnCPLhKMSGcKIx8ZphqwR1kjbFAQ6jkyDKXGeFpQQQRptGk6m4HW8W-J9n3we1CGeUigvFaKUFgOMikLBkbIp5px8o_rUdiW9QlCdtamiTZ21qYu2svIyrrTe-yvOmaCYYvIPu-JokQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1444662547</pqid></control><display><type>article</type><title>A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Tomlinson, Martin ; Jibril, Mubarak ; Tjhai, Cen ; Bezzateev, Sergey V. ; Grassl, Markus ; Ahmed, Mohammed Zaki</creator><creatorcontrib>Tomlinson, Martin ; Jibril, Mubarak ; Tjhai, Cen ; Bezzateev, Sergey V. ; Grassl, Markus ; Ahmed, Mohammed Zaki</creatorcontrib><description>We present an efficient construction of extended length Goppa codes. Using this construction, we obtain 78 new nonbinary codes with better minimum distance than the previously known codes with the same length and dimension. The construction is based on the observation that certain Goppa codes can be seen as BCH codes.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2013.2276626</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>BCH ; Codes ; Educational institutions ; Electronic mail ; error correction ; Goppa ; Information theory ; Parity check codes ; Polynomials ; Redundancy ; Reed-Solomon ; Vectors</subject><ispartof>IEEE transactions on information theory, 2013-11, Vol.59 (11), p.7299-7304</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-6090d77b981c57d491b353e2bda51cb7cb9cf90d0d61bf243de481c3373fabf63</citedby><cites>FETCH-LOGICAL-c291t-6090d77b981c57d491b353e2bda51cb7cb9cf90d0d61bf243de481c3373fabf63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6574242$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6574242$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Tomlinson, Martin</creatorcontrib><creatorcontrib>Jibril, Mubarak</creatorcontrib><creatorcontrib>Tjhai, Cen</creatorcontrib><creatorcontrib>Bezzateev, Sergey V.</creatorcontrib><creatorcontrib>Grassl, Markus</creatorcontrib><creatorcontrib>Ahmed, Mohammed Zaki</creatorcontrib><title>A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We present an efficient construction of extended length Goppa codes. Using this construction, we obtain 78 new nonbinary codes with better minimum distance than the previously known codes with the same length and dimension. The construction is based on the observation that certain Goppa codes can be seen as BCH codes.</description><subject>BCH</subject><subject>Codes</subject><subject>Educational institutions</subject><subject>Electronic mail</subject><subject>error correction</subject><subject>Goppa</subject><subject>Information theory</subject><subject>Parity check codes</subject><subject>Polynomials</subject><subject>Redundancy</subject><subject>Reed-Solomon</subject><subject>Vectors</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEQhoMoWKt3wcuC5635TnMsxdZCsZd6Dvla2NJN1mQr6K83ZUtPwwzPzLw8ADwjOEMIyrf9Zj_DEJEZxoJzzG_ABDEmaskZvQUTCNG8lpTO78FDzofSUobwBOwW1doHn_Sx_fOuWsaQh3SyQxtDpYOrNl2f4o_vfBhyVWafMZg26PRbUOdztUqxq9ax7_U4eAR3jT5m_3SpU_C1et8vP-rtbr1ZLra1xRINNYcSOiGMnCPLhKMSGcKIx8ZphqwR1kjbFAQ6jkyDKXGeFpQQQRptGk6m4HW8W-J9n3we1CGeUigvFaKUFgOMikLBkbIp5px8o_rUdiW9QlCdtamiTZ21qYu2svIyrrTe-yvOmaCYYvIPu-JokQ</recordid><startdate>20131101</startdate><enddate>20131101</enddate><creator>Tomlinson, Martin</creator><creator>Jibril, Mubarak</creator><creator>Tjhai, Cen</creator><creator>Bezzateev, Sergey V.</creator><creator>Grassl, Markus</creator><creator>Ahmed, Mohammed Zaki</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20131101</creationdate><title>A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes</title><author>Tomlinson, Martin ; Jibril, Mubarak ; Tjhai, Cen ; Bezzateev, Sergey V. ; Grassl, Markus ; Ahmed, Mohammed Zaki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-6090d77b981c57d491b353e2bda51cb7cb9cf90d0d61bf243de481c3373fabf63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>BCH</topic><topic>Codes</topic><topic>Educational institutions</topic><topic>Electronic mail</topic><topic>error correction</topic><topic>Goppa</topic><topic>Information theory</topic><topic>Parity check codes</topic><topic>Polynomials</topic><topic>Redundancy</topic><topic>Reed-Solomon</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tomlinson, Martin</creatorcontrib><creatorcontrib>Jibril, Mubarak</creatorcontrib><creatorcontrib>Tjhai, Cen</creatorcontrib><creatorcontrib>Bezzateev, Sergey V.</creatorcontrib><creatorcontrib>Grassl, Markus</creatorcontrib><creatorcontrib>Ahmed, Mohammed Zaki</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tomlinson, Martin</au><au>Jibril, Mubarak</au><au>Tjhai, Cen</au><au>Bezzateev, Sergey V.</au><au>Grassl, Markus</au><au>Ahmed, Mohammed Zaki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Generalized Construction and Improvements on Nonbinary Codes From Goppa Codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2013-11-01</date><risdate>2013</risdate><volume>59</volume><issue>11</issue><spage>7299</spage><epage>7304</epage><pages>7299-7304</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We present an efficient construction of extended length Goppa codes. Using this construction, we obtain 78 new nonbinary codes with better minimum distance than the previously known codes with the same length and dimension. The construction is based on the observation that certain Goppa codes can be seen as BCH codes.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2013.2276626</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2013-11, Vol.59 (11), p.7299-7304 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_6574242 |
| source | IEEE Electronic Library (IEL) |
| subjects | BCH Codes Educational institutions Electronic mail error correction Goppa Information theory Parity check codes Polynomials Redundancy Reed-Solomon Vectors |
| title | A Generalized Construction and Improvements on Nonbinary Codes From Goppa 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-21T08%3A14%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Generalized%20Construction%20and%20Improvements%20on%20Nonbinary%20Codes%20From%20Goppa%20Codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Tomlinson,%20Martin&rft.date=2013-11-01&rft.volume=59&rft.issue=11&rft.spage=7299&rft.epage=7304&rft.pages=7299-7304&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2013.2276626&rft_dat=%3Cproquest_RIE%3E3107969951%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1444662547&rft_id=info:pmid/&rft_ieee_id=6574242&rfr_iscdi=true |