纠正非对称反馈信道中的单一错误

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Problems of Information Transmission Pub Date : 2024-08-07 DOI:10.1134/s0032946024010034

I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev

{"title":"纠正非对称反馈信道中的单一错误","authors":"I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev","doi":"10.1134/s0032946024010034","DOIUrl":null,"url":null,"abstract":"<p>We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Correcting a Single Error in an Asymmetric Feedback Channel\",\"authors\":\"I. V. Vorobyev, A. V. Lebedev, V. S. Lebedev\",\"doi\":\"10.1134/s0032946024010034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.</p>\",\"PeriodicalId\":54581,\"journal\":{\"name\":\"Problems of Information Transmission\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Problems of Information Transmission\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/s0032946024010034\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0032946024010034","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了在二进制非对称信道中纠正单个错误的完全反馈编码大小的新下限。我们还提出了一个接近新下限的编码大小上限。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Correcting a Single Error in an Asymmetric Feedback Channel

We prove a new lower bound on the size of a code with complete feedback correcting a single error in a binary asymmetric channel. We also present an upper bound on the size of the code, which is close to the new lower bound.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Problems of Information Transmission 工程技术-计算机：理论方法

CiteScore

2.00

自引率

25.00%

发文量

审稿时长

>12 weeks

期刊介绍： Problems of Information Transmission is of interest to researcher in all fields concerned with the research and development of communication systems. This quarterly journal features coverage of statistical information theory; coding theory and techniques; noisy channels; error detection and correction; signal detection, extraction, and analysis; analysis of communication networks; optimal processing and routing; the theory of random processes; and bionics.