{"title":"关于多值可分离无序码","authors":"Y. Nagata, M. Mukaidono","doi":"10.1109/ISMVL.1994.302179","DOIUrl":null,"url":null,"abstract":"A new encoding/decoding scheme of multiple-valued separable balanced codes are presented. These codes have 2/spl middot/m information digits and m/spl middot/(R-2) check digits in radices R/spl ges/4, and 2/spl middot/m-1 information digits and m+1 check digits in R=3 where code-length n=R/spl middot/m. In actual use of code-lengths and radices, it is shown that the presented codes are efficient in comparison with multiple-valued Berger-codes which are known as optimal unordered codes.<<ETX>>","PeriodicalId":137138,"journal":{"name":"Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On multiple-valued separable unordered codes\",\"authors\":\"Y. Nagata, M. Mukaidono\",\"doi\":\"10.1109/ISMVL.1994.302179\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new encoding/decoding scheme of multiple-valued separable balanced codes are presented. These codes have 2/spl middot/m information digits and m/spl middot/(R-2) check digits in radices R/spl ges/4, and 2/spl middot/m-1 information digits and m+1 check digits in R=3 where code-length n=R/spl middot/m. In actual use of code-lengths and radices, it is shown that the presented codes are efficient in comparison with multiple-valued Berger-codes which are known as optimal unordered codes.<<ETX>>\",\"PeriodicalId\":137138,\"journal\":{\"name\":\"Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1994.302179\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1994.302179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new encoding/decoding scheme of multiple-valued separable balanced codes are presented. These codes have 2/spl middot/m information digits and m/spl middot/(R-2) check digits in radices R/spl ges/4, and 2/spl middot/m-1 information digits and m+1 check digits in R=3 where code-length n=R/spl middot/m. In actual use of code-lengths and radices, it is shown that the presented codes are efficient in comparison with multiple-valued Berger-codes which are known as optimal unordered codes.<>