Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 638 |
|---|---|
| container_issue | |
| container_start_page | 627 |
| container_title | |
| container_volume | 2076 |
| creator | Shankar, Priti Kumar, P.N.A. Singh, Harmeet Rajan, B.S. |
| description | We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures. |
| doi_str_mv | 10.1007/3-540-48224-5_52 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1018040</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3073138_57_641</sourcerecordid><originalsourceid>FETCH-LOGICAL-p309t-6c69fa10ddfc5ceb9e406b2c01489f2f784b67c89a68e312c03c04fc0181934b3</originalsourceid><addsrcrecordid>eNpFkEtPBCEQhPEZN7p3jxy8okAzAxx1sj4SjYlZz4RhGUVxZgU87L-XVRP70kl9VZ10IXTK6DmjVF4AaQQlQnEuSGMavoPmWiqo4o_W7qIZaxkjAELv_TPOlZT7aEaBcqKlgEM0041qOKdMHaF5zm-0DnAmtJyhp4cwhg8b8dKGSK5CCeMLXiYfY8g-42FKuPOp2DDibuNicPgqTu4dd9Oq4svk8cLmDS5TVcZc0pcrJ-hgsDH7-d8-Rs_Xi2V3S-4fb-66y3uyBqoLaV2rB8voajW4xvlee0HbnjvKhNIDH6QSfSud0rZVHlgF4KgYKldMg-jhGJ393l3b7Gwckh1dyGad6j9pY1g1UkGr7fzXlisZX3wy_TS958rNtmcDptZmfjo1255rAP7upunzy-di_Dbh_FiSje7VrotP2QCVwECZRppWMPgGJ1t5TQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3073138_57_641</pqid></control><display><type>book_chapter</type><title>Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct</title><source>Springer Books</source><creator>Shankar, Priti ; Kumar, P.N.A. ; Singh, Harmeet ; Rajan, B.S.</creator><contributor>Orejas, Fernando ; Spirakis, Paul G ; Leeuwen, Jan van ; van Leeuwen, Jan ; Spirakis, Paul G. ; Orejas, Fernando</contributor><creatorcontrib>Shankar, Priti ; Kumar, P.N.A. ; Singh, Harmeet ; Rajan, B.S. ; Orejas, Fernando ; Spirakis, Paul G ; Leeuwen, Jan van ; van Leeuwen, Jan ; Spirakis, Paul G. ; Orejas, Fernando</creatorcontrib><description>We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540422877</identifier><identifier>ISBN: 3540422870</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540482246</identifier><identifier>EISBN: 3540482245</identifier><identifier>DOI: 10.1007/3-540-48224-5_52</identifier><identifier>OCLC: 958522018</identifier><identifier>LCCallNum: QA76.758</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Coding, codes ; Computer science; control theory; systems ; cyclic codes ; Exact sciences and technology ; Information retrieval. Graph ; Information, signal and communications theory ; linear block codes ; Reed-Solomon codes ; Signal and communications theory ; tail-biting trellises ; Telecommunications and information theory ; Theoretical computing</subject><ispartof>Automata, Languages and Programming, 2001, Vol.2076, p.627-638</ispartof><rights>Springer-Verlag Berlin Heidelberg 2001</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3073138-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-48224-5_52$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-48224-5_52$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1018040$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Orejas, Fernando</contributor><contributor>Spirakis, Paul G</contributor><contributor>Leeuwen, Jan van</contributor><contributor>van Leeuwen, Jan</contributor><contributor>Spirakis, Paul G.</contributor><contributor>Orejas, Fernando</contributor><creatorcontrib>Shankar, Priti</creatorcontrib><creatorcontrib>Kumar, P.N.A.</creatorcontrib><creatorcontrib>Singh, Harmeet</creatorcontrib><creatorcontrib>Rajan, B.S.</creatorcontrib><title>Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct</title><title>Automata, Languages and Programming</title><description>We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.</description><subject>Applied sciences</subject><subject>Coding, codes</subject><subject>Computer science; control theory; systems</subject><subject>cyclic codes</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Information, signal and communications theory</subject><subject>linear block codes</subject><subject>Reed-Solomon codes</subject><subject>Signal and communications theory</subject><subject>tail-biting trellises</subject><subject>Telecommunications and information theory</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540422877</isbn><isbn>3540422870</isbn><isbn>9783540482246</isbn><isbn>3540482245</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2001</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFkEtPBCEQhPEZN7p3jxy8okAzAxx1sj4SjYlZz4RhGUVxZgU87L-XVRP70kl9VZ10IXTK6DmjVF4AaQQlQnEuSGMavoPmWiqo4o_W7qIZaxkjAELv_TPOlZT7aEaBcqKlgEM0041qOKdMHaF5zm-0DnAmtJyhp4cwhg8b8dKGSK5CCeMLXiYfY8g-42FKuPOp2DDibuNicPgqTu4dd9Oq4svk8cLmDS5TVcZc0pcrJ-hgsDH7-d8-Rs_Xi2V3S-4fb-66y3uyBqoLaV2rB8voajW4xvlee0HbnjvKhNIDH6QSfSud0rZVHlgF4KgYKldMg-jhGJ393l3b7Gwckh1dyGad6j9pY1g1UkGr7fzXlisZX3wy_TS958rNtmcDptZmfjo1255rAP7upunzy-di_Dbh_FiSje7VrotP2QCVwECZRppWMPgGJ1t5TQ</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Shankar, Priti</creator><creator>Kumar, P.N.A.</creator><creator>Singh, Harmeet</creator><creator>Rajan, B.S.</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2001</creationdate><title>Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct</title><author>Shankar, Priti ; Kumar, P.N.A. ; Singh, Harmeet ; Rajan, B.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p309t-6c69fa10ddfc5ceb9e406b2c01489f2f784b67c89a68e312c03c04fc0181934b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Applied sciences</topic><topic>Coding, codes</topic><topic>Computer science; control theory; systems</topic><topic>cyclic codes</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Information, signal and communications theory</topic><topic>linear block codes</topic><topic>Reed-Solomon codes</topic><topic>Signal and communications theory</topic><topic>tail-biting trellises</topic><topic>Telecommunications and information theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shankar, Priti</creatorcontrib><creatorcontrib>Kumar, P.N.A.</creatorcontrib><creatorcontrib>Singh, Harmeet</creatorcontrib><creatorcontrib>Rajan, B.S.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shankar, Priti</au><au>Kumar, P.N.A.</au><au>Singh, Harmeet</au><au>Rajan, B.S.</au><au>Orejas, Fernando</au><au>Spirakis, Paul G</au><au>Leeuwen, Jan van</au><au>van Leeuwen, Jan</au><au>Spirakis, Paul G.</au><au>Orejas, Fernando</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct</atitle><btitle>Automata, Languages and Programming</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2001</date><risdate>2001</risdate><volume>2076</volume><spage>627</spage><epage>638</epage><pages>627-638</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540422877</isbn><isbn>3540422870</isbn><eisbn>9783540482246</eisbn><eisbn>3540482245</eisbn><abstract>We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-48224-5_52</doi><oclcid>958522018</oclcid><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automata, Languages and Programming, 2001, Vol.2076, p.627-638 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1018040 |
| source | Springer Books |
| subjects | Applied sciences Coding, codes Computer science control theory systems cyclic codes Exact sciences and technology Information retrieval. Graph Information, signal and communications theory linear block codes Reed-Solomon codes Signal and communications theory tail-biting trellises Telecommunications and information theory Theoretical computing |
| title | Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T23%3A10%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Minimal%20Tail-Biting%20Trellises%20for%20Certain%20Cyclic%20Block%20Codes%20Are%20Easy%20to%20Construct&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=Shankar,%20Priti&rft.date=2001&rft.volume=2076&rft.spage=627&rft.epage=638&rft.pages=627-638&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540422877&rft.isbn_list=3540422870&rft_id=info:doi/10.1007/3-540-48224-5_52&rft_dat=%3Cproquest_pasca%3EEBC3073138_57_641%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540482246&rft.eisbn_list=3540482245&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3073138_57_641&rft_id=info:pmid/&rfr_iscdi=true |