A Modification of Generalized Concatenated Codes and its Applications
We propose a modification of generalized concatenated codes, which allows the construction of some best known binary linear codes in a very simple way. As another application we show that by using this method we can generate a big class of optimal linear unequal error protection codes (LUEP codes) v...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 382 |
---|---|
container_issue | |
container_start_page | 382 |
container_title | |
container_volume | |
creator | Yan Gao Dettmar, U. Sorger, U.K. |
description | We propose a modification of generalized concatenated codes, which allows the construction of some best known binary linear codes in a very simple way. As another application we show that by using this method we can generate a big class of optimal linear unequal error protection codes (LUEP codes) very easily and that most of the constructions given by van Gils [1] are special cases of this new method. A big advantage of our method is, that all constructed codes can be decoded very easily by the well known Blokh-Z yablov-Zinov'ev algorithm with a slightly modified metric. |
doi_str_mv | 10.1109/ISIT.1993.748698 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_748698</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>748698</ieee_id><sourcerecordid>748698</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-45a00282a5ddcece36d329cabc9d687e38b34e4bdb86dbc20811a18ce94724643</originalsourceid><addsrcrecordid>eNotT8tqwzAQFJRCSup76Ek_YFcvS6ujMWlqSOihvgdZWoOKaxvLl_br65IMMwzDsgNDyIGzgnNmX5vPpi24tbIwCrSFB5JZA2yjZGDA7EiW0hfboEpmtXoix4pephD76N0ap5FOPT3hiIsb4i8GWk_jdsBx038ImKgbA41rotU8D_ev9EweezckzO6-J-3bsa3f8_PHqamrcx7BrLkqHWMChCtD8OhR6iCF9a7zNmgwKKGTClUXOtCh84IB546DR6uMUFrJPXm51UZEvM5L_HbLz_U2Vf4BfBVJuA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Modification of Generalized Concatenated Codes and its Applications</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yan Gao ; Dettmar, U. ; Sorger, U.K.</creator><creatorcontrib>Yan Gao ; Dettmar, U. ; Sorger, U.K.</creatorcontrib><description>We propose a modification of generalized concatenated codes, which allows the construction of some best known binary linear codes in a very simple way. As another application we show that by using this method we can generate a big class of optimal linear unequal error protection codes (LUEP codes) very easily and that most of the constructions given by van Gils [1] are special cases of this new method. A big advantage of our method is, that all constructed codes can be decoded very easily by the well known Blokh-Z yablov-Zinov'ev algorithm with a slightly modified metric.</description><identifier>ISBN: 9780780308787</identifier><identifier>ISBN: 0780308786</identifier><identifier>DOI: 10.1109/ISIT.1993.748698</identifier><language>eng</language><publisher>IEEE</publisher><subject>Artificial intelligence ; Concatenated codes ; Decoding ; Error correction codes ; Gas insulated transmission lines ; Linear code ; Partitioning algorithms</subject><ispartof>Proceedings. IEEE International Symposium on Information Theory, 1993, p.382-382</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/748698$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/748698$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yan Gao</creatorcontrib><creatorcontrib>Dettmar, U.</creatorcontrib><creatorcontrib>Sorger, U.K.</creatorcontrib><title>A Modification of Generalized Concatenated Codes and its Applications</title><title>Proceedings. IEEE International Symposium on Information Theory</title><addtitle>ISIT</addtitle><description>We propose a modification of generalized concatenated codes, which allows the construction of some best known binary linear codes in a very simple way. As another application we show that by using this method we can generate a big class of optimal linear unequal error protection codes (LUEP codes) very easily and that most of the constructions given by van Gils [1] are special cases of this new method. A big advantage of our method is, that all constructed codes can be decoded very easily by the well known Blokh-Z yablov-Zinov'ev algorithm with a slightly modified metric.</description><subject>Artificial intelligence</subject><subject>Concatenated codes</subject><subject>Decoding</subject><subject>Error correction codes</subject><subject>Gas insulated transmission lines</subject><subject>Linear code</subject><subject>Partitioning algorithms</subject><isbn>9780780308787</isbn><isbn>0780308786</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1993</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT8tqwzAQFJRCSup76Ek_YFcvS6ujMWlqSOihvgdZWoOKaxvLl_br65IMMwzDsgNDyIGzgnNmX5vPpi24tbIwCrSFB5JZA2yjZGDA7EiW0hfboEpmtXoix4pephD76N0ap5FOPT3hiIsb4i8GWk_jdsBx038ImKgbA41rotU8D_ev9EweezckzO6-J-3bsa3f8_PHqamrcx7BrLkqHWMChCtD8OhR6iCF9a7zNmgwKKGTClUXOtCh84IB546DR6uMUFrJPXm51UZEvM5L_HbLz_U2Vf4BfBVJuA</recordid><startdate>1993</startdate><enddate>1993</enddate><creator>Yan Gao</creator><creator>Dettmar, U.</creator><creator>Sorger, U.K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1993</creationdate><title>A Modification of Generalized Concatenated Codes and its Applications</title><author>Yan Gao ; Dettmar, U. ; Sorger, U.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-45a00282a5ddcece36d329cabc9d687e38b34e4bdb86dbc20811a18ce94724643</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Artificial intelligence</topic><topic>Concatenated codes</topic><topic>Decoding</topic><topic>Error correction codes</topic><topic>Gas insulated transmission lines</topic><topic>Linear code</topic><topic>Partitioning algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Yan Gao</creatorcontrib><creatorcontrib>Dettmar, U.</creatorcontrib><creatorcontrib>Sorger, U.K.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yan Gao</au><au>Dettmar, U.</au><au>Sorger, U.K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Modification of Generalized Concatenated Codes and its Applications</atitle><btitle>Proceedings. IEEE International Symposium on Information Theory</btitle><stitle>ISIT</stitle><date>1993</date><risdate>1993</risdate><spage>382</spage><epage>382</epage><pages>382-382</pages><isbn>9780780308787</isbn><isbn>0780308786</isbn><abstract>We propose a modification of generalized concatenated codes, which allows the construction of some best known binary linear codes in a very simple way. As another application we show that by using this method we can generate a big class of optimal linear unequal error protection codes (LUEP codes) very easily and that most of the constructions given by van Gils [1] are special cases of this new method. A big advantage of our method is, that all constructed codes can be decoded very easily by the well known Blokh-Z yablov-Zinov'ev algorithm with a slightly modified metric.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.1993.748698</doi><tpages>1</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780780308787 |
ispartof | Proceedings. IEEE International Symposium on Information Theory, 1993, p.382-382 |
issn | |
language | eng |
recordid | cdi_ieee_primary_748698 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Artificial intelligence Concatenated codes Decoding Error correction codes Gas insulated transmission lines Linear code Partitioning algorithms |
title | A Modification of Generalized Concatenated Codes and its Applications |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A24%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Modification%20of%20Generalized%20Concatenated%20Codes%20and%20its%20Applications&rft.btitle=Proceedings.%20IEEE%20International%20Symposium%20on%20Information%20Theory&rft.au=Yan%20Gao&rft.date=1993&rft.spage=382&rft.epage=382&rft.pages=382-382&rft.isbn=9780780308787&rft.isbn_list=0780308786&rft_id=info:doi/10.1109/ISIT.1993.748698&rft_dat=%3Cieee_6IE%3E748698%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=748698&rfr_iscdi=true |