{"title":"二值灰度码的一些性质","authors":"K. Nagata, F. Nemenzo","doi":"10.1109/CCATS.2015.27","DOIUrl":null,"url":null,"abstract":"The binary Gray code, or the reflected binary code, is a code whose code-word changes only one bit and the Hamming distance of two adjacent code-words is always one. Although the binary Gray code itself has many plications and is related to theoretical or practical facts, we are interested in it as a transforming function from a residue numbers modulo a power of 2 to a product of binary number of certain size. In this paper, we especially focus on the weight of n-the code-word, and give some properties of the weight which might help us to lead a map with a required characteristics.","PeriodicalId":433684,"journal":{"name":"2015 International Conference on Computer Application Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Some Properties of Binary Gray Code\",\"authors\":\"K. Nagata, F. Nemenzo\",\"doi\":\"10.1109/CCATS.2015.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The binary Gray code, or the reflected binary code, is a code whose code-word changes only one bit and the Hamming distance of two adjacent code-words is always one. Although the binary Gray code itself has many plications and is related to theoretical or practical facts, we are interested in it as a transforming function from a residue numbers modulo a power of 2 to a product of binary number of certain size. In this paper, we especially focus on the weight of n-the code-word, and give some properties of the weight which might help us to lead a map with a required characteristics.\",\"PeriodicalId\":433684,\"journal\":{\"name\":\"2015 International Conference on Computer Application Technologies\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Computer Application Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCATS.2015.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Application Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCATS.2015.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The binary Gray code, or the reflected binary code, is a code whose code-word changes only one bit and the Hamming distance of two adjacent code-words is always one. Although the binary Gray code itself has many plications and is related to theoretical or practical facts, we are interested in it as a transforming function from a residue numbers modulo a power of 2 to a product of binary number of certain size. In this paper, we especially focus on the weight of n-the code-word, and give some properties of the weight which might help us to lead a map with a required characteristics.