论二进制码组合的几个特征

A. S. Adzhemov, S. A. Adzhemov
{"title":"论二进制码组合的几个特征","authors":"A. S. Adzhemov, S. A. Adzhemov","doi":"10.1109/SOSG.2019.8706817","DOIUrl":null,"url":null,"abstract":"When digitally displaying various messages, it is important to understand the characteristics of the generated digital sequences, to be able to evaluate the potential possibilities of such transformations. For this purpose, exact analytical expressions are derived for obtaining the number of code combinations for a given minimum code distance and the length of the code combination. Potentially achievable exact bounds for minimum code distances of 2, 3 and 4 are given.","PeriodicalId":418978,"journal":{"name":"2019 Systems of Signals Generating and Processing in the Field of on Board Communications","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On Some Features of Binary Code Combinations\",\"authors\":\"A. S. Adzhemov, S. A. Adzhemov\",\"doi\":\"10.1109/SOSG.2019.8706817\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When digitally displaying various messages, it is important to understand the characteristics of the generated digital sequences, to be able to evaluate the potential possibilities of such transformations. For this purpose, exact analytical expressions are derived for obtaining the number of code combinations for a given minimum code distance and the length of the code combination. Potentially achievable exact bounds for minimum code distances of 2, 3 and 4 are given.\",\"PeriodicalId\":418978,\"journal\":{\"name\":\"2019 Systems of Signals Generating and Processing in the Field of on Board Communications\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Systems of Signals Generating and Processing in the Field of on Board Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOSG.2019.8706817\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Systems of Signals Generating and Processing in the Field of on Board Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOSG.2019.8706817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

当数字显示各种消息时,了解生成的数字序列的特征是很重要的,以便能够评估这种转换的潜在可能性。为此,导出了在给定最小码距下的码组合数和码组合长度的精确解析表达式。给出了最小码距2、3和4可能实现的精确边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Some Features of Binary Code Combinations
When digitally displaying various messages, it is important to understand the characteristics of the generated digital sequences, to be able to evaluate the potential possibilities of such transformations. For this purpose, exact analytical expressions are derived for obtaining the number of code combinations for a given minimum code distance and the length of the code combination. Potentially achievable exact bounds for minimum code distances of 2, 3 and 4 are given.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信