Loading…
Codebook and marker sequence design for synchronization-correcting codes
We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries e...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 1583 |
container_issue | |
container_start_page | 1579 |
container_title | |
container_volume | |
creator | Buttigieg, V. Briffa, J. A. |
description | We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries even at high error rates. An upper bound is given for the performance of these codes over a channel with random substitutions and synchronization errors. It is shown that the performance is largely dependent on the code's minimum Levenshtein distance. The performance of these codes is verified by simulation and compared to published results. In concatenation with a non-binary outer code we obtain a significant improvement in frame error rate at similar overall code rates. |
doi_str_mv | 10.1109/ISIT.2011.6033810 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6033810</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6033810</ieee_id><sourcerecordid>6033810</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-8385585e72e11fe9517fb9bb93f72fcb73204354cc299795f566a85f6fa9a32c3</originalsourceid><addsrcrecordid>eNo1kMtOwzAURM1LopR8AGKTH0jxtXP9WKIIaKVKLCjrynGuiynYkJRF-Xoi0c5mpDnSaDSM3QCfAXB7t3hZrGaCA8wUl9IAP2GF1QZq1JqjRXnKJgJQVwZAn7GrI1Dq_Ai4xUtWDMM7H6WUldxM2LzJHbU5b0uXuvLT9Vvqy4G-fyh5Kjsa4iaVIY_ZPvm3Pqf463Yxp8rnvie_i2lT-rFiuGYXwX0MVBx8yl4fH1bNvFo-Py2a-2UVBZhdZaRBNEhaEEAgi6BDa9vWyqBF8K2WgtcSa--FtdpiQKWcwaCCs04KL6fs9r83EtH6q4_j5v36cIr8A0mTUWI</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Codebook and marker sequence design for synchronization-correcting codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Buttigieg, V. ; Briffa, J. A.</creator><creatorcontrib>Buttigieg, V. ; Briffa, J. A.</creatorcontrib><description>We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries even at high error rates. An upper bound is given for the performance of these codes over a channel with random substitutions and synchronization errors. It is shown that the performance is largely dependent on the code's minimum Levenshtein distance. The performance of these codes is verified by simulation and compared to published results. In concatenation with a non-binary outer code we obtain a significant improvement in frame error rate at similar overall code rates.</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 1457705966</identifier><identifier>ISBN: 9781457705960</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 9781457705953</identifier><identifier>EISBN: 145770594X</identifier><identifier>EISBN: 9781457705946</identifier><identifier>EISBN: 1457705958</identifier><identifier>DOI: 10.1109/ISIT.2011.6033810</identifier><language>eng</language><publisher>IEEE</publisher><subject>Insertion-Deletion Correction ; Noise ; Synchronization</subject><ispartof>2011 IEEE International Symposium on Information Theory Proceedings, 2011, p.1579-1583</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6033810$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6033810$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Buttigieg, V.</creatorcontrib><creatorcontrib>Briffa, J. A.</creatorcontrib><title>Codebook and marker sequence design for synchronization-correcting codes</title><title>2011 IEEE International Symposium on Information Theory Proceedings</title><addtitle>ISIT</addtitle><description>We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries even at high error rates. An upper bound is given for the performance of these codes over a channel with random substitutions and synchronization errors. It is shown that the performance is largely dependent on the code's minimum Levenshtein distance. The performance of these codes is verified by simulation and compared to published results. In concatenation with a non-binary outer code we obtain a significant improvement in frame error rate at similar overall code rates.</description><subject>Insertion-Deletion Correction</subject><subject>Noise</subject><subject>Synchronization</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>1457705966</isbn><isbn>9781457705960</isbn><isbn>9781457705953</isbn><isbn>145770594X</isbn><isbn>9781457705946</isbn><isbn>1457705958</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kMtOwzAURM1LopR8AGKTH0jxtXP9WKIIaKVKLCjrynGuiynYkJRF-Xoi0c5mpDnSaDSM3QCfAXB7t3hZrGaCA8wUl9IAP2GF1QZq1JqjRXnKJgJQVwZAn7GrI1Dq_Ai4xUtWDMM7H6WUldxM2LzJHbU5b0uXuvLT9Vvqy4G-fyh5Kjsa4iaVIY_ZPvm3Pqf463Yxp8rnvie_i2lT-rFiuGYXwX0MVBx8yl4fH1bNvFo-Py2a-2UVBZhdZaRBNEhaEEAgi6BDa9vWyqBF8K2WgtcSa--FtdpiQKWcwaCCs04KL6fs9r83EtH6q4_j5v36cIr8A0mTUWI</recordid><startdate>20110101</startdate><enddate>20110101</enddate><creator>Buttigieg, V.</creator><creator>Briffa, J. A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20110101</creationdate><title>Codebook and marker sequence design for synchronization-correcting codes</title><author>Buttigieg, V. ; Briffa, J. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-8385585e72e11fe9517fb9bb93f72fcb73204354cc299795f566a85f6fa9a32c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Insertion-Deletion Correction</topic><topic>Noise</topic><topic>Synchronization</topic><toplevel>online_resources</toplevel><creatorcontrib>Buttigieg, V.</creatorcontrib><creatorcontrib>Briffa, J. A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Buttigieg, V.</au><au>Briffa, J. A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Codebook and marker sequence design for synchronization-correcting codes</atitle><btitle>2011 IEEE International Symposium on Information Theory Proceedings</btitle><stitle>ISIT</stitle><date>2011-01-01</date><risdate>2011</risdate><spage>1579</spage><epage>1583</epage><pages>1579-1583</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>1457705966</isbn><isbn>9781457705960</isbn><eisbn>9781457705953</eisbn><eisbn>145770594X</eisbn><eisbn>9781457705946</eisbn><eisbn>1457705958</eisbn><abstract>We propose a construction based on synchronization and error-correcting block codes and a matched marker sequence. The block codes can correct insertion, deletion and substitution errors within each codeword. The marker sequence allows the decoder to maintain synchronization at codeword boundaries even at high error rates. An upper bound is given for the performance of these codes over a channel with random substitutions and synchronization errors. It is shown that the performance is largely dependent on the code's minimum Levenshtein distance. The performance of these codes is verified by simulation and compared to published results. In concatenation with a non-binary outer code we obtain a significant improvement in frame error rate at similar overall code rates.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2011.6033810</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2157-8095 |
ispartof | 2011 IEEE International Symposium on Information Theory Proceedings, 2011, p.1579-1583 |
issn | 2157-8095 2157-8117 |
language | eng |
recordid | cdi_ieee_primary_6033810 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Insertion-Deletion Correction Noise Synchronization |
title | Codebook and marker sequence design for synchronization-correcting codes |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T23%3A43%3A24IST&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=Codebook%20and%20marker%20sequence%20design%20for%20synchronization-correcting%20codes&rft.btitle=2011%20IEEE%20International%20Symposium%20on%20Information%20Theory%20Proceedings&rft.au=Buttigieg,%20V.&rft.date=2011-01-01&rft.spage=1579&rft.epage=1583&rft.pages=1579-1583&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=1457705966&rft.isbn_list=9781457705960&rft_id=info:doi/10.1109/ISIT.2011.6033810&rft.eisbn=9781457705953&rft.eisbn_list=145770594X&rft.eisbn_list=9781457705946&rft.eisbn_list=1457705958&rft_dat=%3Cieee_6IE%3E6033810%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i218t-8385585e72e11fe9517fb9bb93f72fcb73204354cc299795f566a85f6fa9a32c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6033810&rfr_iscdi=true |