利用(m, n)码字的任意子集的特殊公式实现了自检检查器的设计

2011 9th East-West Design & Test Symposium (EWDTS) Pub Date : 2011-09-09 DOI:10.1109/EWDTS.2011.6116599

N. Butorina, S. Ostanin

{"title":"利用(m, n)码字的任意子集的特殊公式实现了自检检查器的设计","authors":"N. Butorina, S. Ostanin","doi":"10.1109/EWDTS.2011.6116599","DOIUrl":null,"url":null,"abstract":"The problem of synthesis of the self-testing checker for arbitrary l code words of (m, n)-code is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the code words corresponding to essential subtrees of the tree representing all code words of (m, n)-code is investigated. The properties such essential subtries are described.","PeriodicalId":339676,"journal":{"name":"2011 9th East-West Design & Test Symposium (EWDTS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Implementation by the special formula of an arbitrary subset of code words of (m, n)-code for designing a self-testing checker\",\"authors\":\"N. Butorina, S. Ostanin\",\"doi\":\"10.1109/EWDTS.2011.6116599\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of synthesis of the self-testing checker for arbitrary l code words of (m, n)-code is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the code words corresponding to essential subtrees of the tree representing all code words of (m, n)-code is investigated. The properties such essential subtries are described.\",\"PeriodicalId\":339676,\"journal\":{\"name\":\"2011 9th East-West Design & Test Symposium (EWDTS)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 9th East-West Design & Test Symposium (EWDTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EWDTS.2011.6116599\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 9th East-West Design & Test Symposium (EWDTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EWDTS.2011.6116599","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究任意(m, n)码的l码字的自检检查器的综合问题。特别地，研究了用表示(m, n)码的所有码字的树的基本子树对应的码字子集的基数和来表示数字l的问题。描述了这些基本子元素的属性。

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

查看原文本刊更多论文

Implementation by the special formula of an arbitrary subset of code words of (m, n)-code for designing a self-testing checker

The problem of synthesis of the self-testing checker for arbitrary l code words of (m, n)-code is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the code words corresponding to essential subtrees of the tree representing all code words of (m, n)-code is investigated. The properties such essential subtries are described.

求助全文

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

来源期刊

2011 9th East-West Design & Test Symposium (EWDTS)

自引率

0.00%

发文量