Synchronizing block codes with a decoder for variable-length codes

U. Speidel, T. Gulliver
{"title":"Synchronizing block codes with a decoder for variable-length codes","authors":"U. Speidel, T. Gulliver","doi":"10.1109/ISIT.2007.4557460","DOIUrl":null,"url":null,"abstract":"It is well known that any two non-identical codewords from a fixed-length code must belong to different non- periodic equivalence classes under cyclic shift for the code to have a bounded synchronization delay (BSD). Subsets of fixed- length codewords from T-codes, a family of variable-length codes (VLCs) known for strong statistical self-synchronization and a well-explained synchronization model, also follow this rule, albeit with some periodic exceptions. This paper shows how the T-code construction algorithm may be used for the simple construction of maximal block codes with bounded synchronization delay. These self-synchronizing codes are subsets of T-codes and thus resynchronization under decoding with a T-code decoder is both automatic and detectable.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557460","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

It is well known that any two non-identical codewords from a fixed-length code must belong to different non- periodic equivalence classes under cyclic shift for the code to have a bounded synchronization delay (BSD). Subsets of fixed- length codewords from T-codes, a family of variable-length codes (VLCs) known for strong statistical self-synchronization and a well-explained synchronization model, also follow this rule, albeit with some periodic exceptions. This paper shows how the T-code construction algorithm may be used for the simple construction of maximal block codes with bounded synchronization delay. These self-synchronizing codes are subsets of T-codes and thus resynchronization under decoding with a T-code decoder is both automatic and detectable.
将块码与可变长度码的解码器同步
众所周知,固定长度码中任意两个不相同的码字在循环移位下必须属于不同的非周期等价类,才能使码具有有界同步延迟(BSD)。t码是一组变长码(vlc),以强大的统计自同步和解释良好的同步模型而闻名,其中固定长度码字的子集也遵循这一规则,尽管有一些周期性的例外。本文讨论了如何利用t码构造算法来构造具有有限同步延迟的最大分组码。这些自同步码是t码的子集,因此在t码解码器解码下的再同步是自动的和可检测的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信