{"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}
引用次数: 2
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