类准备代码的测试集

IF 0.58 Q3 Engineering Journal of Applied and Industrial Mathematics Pub Date : 2023-08-07 DOI:10.1134/S1990478923020205

A. Yu. Vasil’eva

{"title":"类准备代码的测试集","authors":"A. Yu. Vasil’eva","doi":"10.1134/S1990478923020205","DOIUrl":null,"url":null,"abstract":" The reconstruction of an object of a given class by its intersection with some (so-called\ntesting) set is studied. For the class, we consider Preparata-like codes, i.e., nonlinear codes of\nlength\n\\( n=2^{2m}-1 \\),\n\\( m=2,3,\\dots \\), with code distance 5 and twice the size of a linear code of the same length\nand distance. Conditions are determined under which the union of a few concentric spheres forms\na testing set for Preparata-like codes.\n","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 2","pages":"427 - 432"},"PeriodicalIF":0.5800,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Testing Set for Preparata-Like Codes\",\"authors\":\"A. Yu. Vasil’eva\",\"doi\":\"10.1134/S1990478923020205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\" The reconstruction of an object of a given class by its intersection with some (so-called\\ntesting) set is studied. For the class, we consider Preparata-like codes, i.e., nonlinear codes of\\nlength\\n\\\\( n=2^{2m}-1 \\\\),\\n\\\\( m=2,3,\\\\dots \\\\), with code distance 5 and twice the size of a linear code of the same length\\nand distance. Conditions are determined under which the union of a few concentric spheres forms\\na testing set for Preparata-like codes.\\n\",\"PeriodicalId\":607,\"journal\":{\"name\":\"Journal of Applied and Industrial Mathematics\",\"volume\":\"17 2\",\"pages\":\"427 - 432\"},\"PeriodicalIF\":0.5800,\"publicationDate\":\"2023-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Industrial Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1990478923020205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923020205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 0

摘要

研究了给定类对象与某个(所谓的测试)集的交集对其进行重构的问题。对于该类，我们考虑类prepare码，即长度为\( n=2^{2m}-1 \), \( m=2,3,\dots \)的非线性码，码距为5，是相同长度和距离的线性码的两倍。确定了几个同心球的并集构成拟备码测试集的条件。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Testing Set for Preparata-Like Codes

The reconstruction of an object of a given class by its intersection with some (so-called testing) set is studied. For the class, we consider Preparata-like codes, i.e., nonlinear codes of length \( n=2^{2m}-1 \), \( m=2,3,\dots \), with code distance 5 and twice the size of a linear code of the same length and distance. Conditions are determined under which the union of a few concentric spheres forms a testing set for Preparata-like codes.

求助全文

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

来源期刊

Journal of Applied and Industrial Mathematics Engineering-Industrial and Manufacturing Engineering

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.