{"title":"距离为2的线性二进制完全正则码","authors":"A. Vasil'eva","doi":"10.1109/SIBIRCON.2008.4602615","DOIUrl":null,"url":null,"abstract":"We investigate completely regular codes with the small code distance. These codes are interesting because they play the role of natural subcodes of some good codes. The construction of the linear completely regular code with code distance 2 is given. The connected components of the graph of minimal distances of a linear completely regular code is described. The structure of a linear completely regular code with code distance 2 is studied.","PeriodicalId":295946,"journal":{"name":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Linear binary completely regular codes with distance 2\",\"authors\":\"A. Vasil'eva\",\"doi\":\"10.1109/SIBIRCON.2008.4602615\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate completely regular codes with the small code distance. These codes are interesting because they play the role of natural subcodes of some good codes. The construction of the linear completely regular code with code distance 2 is given. The connected components of the graph of minimal distances of a linear completely regular code is described. The structure of a linear completely regular code with code distance 2 is studied.\",\"PeriodicalId\":295946,\"journal\":{\"name\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2008.4602615\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2008.4602615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linear binary completely regular codes with distance 2
We investigate completely regular codes with the small code distance. These codes are interesting because they play the role of natural subcodes of some good codes. The construction of the linear completely regular code with code distance 2 is given. The connected components of the graph of minimal distances of a linear completely regular code is described. The structure of a linear completely regular code with code distance 2 is studied.