用于错误检测的大适当代码

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI:10.1109/ITW2.2006.323781

Irina Naydenova, T. Kløve

{"title":"用于错误检测的大适当代码","authors":"Irina Naydenova, T. Kløve","doi":"10.1109/ITW2.2006.323781","DOIUrl":null,"url":null,"abstract":"Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"375 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Large proper codes for error detection\",\"authors\":\"Irina Naydenova, T. Kløve\",\"doi\":\"10.1109/ITW2.2006.323781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"375 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

大代码适合于错误检测。在本文中，我们讨论了多大是大。利用已知的适当码的引理和定理，给出了适合于错误检测的码的大小的下界

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

查看原文本刊更多论文

Large proper codes for error detection

Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection

求助全文

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

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

自引率

0.00%

发文量