{"title":"安全有限状态整数算术码","authors":"H. Moradmand, A. Payandeh","doi":"10.1109/ATC.2011.6027424","DOIUrl":null,"url":null,"abstract":"In this paper finite state characteristic of integer arithmetic codes (FSAC) is combined with prefix free characteristic of Huffman codes to yield security in source codes. Some random jumps are inserted in transition sequence of state diagram to provide security. Huffman codes are used to make possible tracking and therefore decoding in jump instants.","PeriodicalId":221905,"journal":{"name":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Secure finite state integer arithmetic codes\",\"authors\":\"H. Moradmand, A. Payandeh\",\"doi\":\"10.1109/ATC.2011.6027424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper finite state characteristic of integer arithmetic codes (FSAC) is combined with prefix free characteristic of Huffman codes to yield security in source codes. Some random jumps are inserted in transition sequence of state diagram to provide security. Huffman codes are used to make possible tracking and therefore decoding in jump instants.\",\"PeriodicalId\":221905,\"journal\":{\"name\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATC.2011.6027424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2011 International Conference on Advanced Technologies for Communications (ATC 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATC.2011.6027424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper finite state characteristic of integer arithmetic codes (FSAC) is combined with prefix free characteristic of Huffman codes to yield security in source codes. Some random jumps are inserted in transition sequence of state diagram to provide security. Huffman codes are used to make possible tracking and therefore decoding in jump instants.