{"title":"贪心码的g值解码","authors":"K. Ahmad","doi":"10.1109/ICICT.2005.1598559","DOIUrl":null,"url":null,"abstract":"Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome Decoding Array (S.D.A).","PeriodicalId":276741,"journal":{"name":"2005 International Conference on Information and Communication Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"G-value Decoding of Greedy Codes\",\"authors\":\"K. Ahmad\",\"doi\":\"10.1109/ICICT.2005.1598559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome Decoding Array (S.D.A).\",\"PeriodicalId\":276741,\"journal\":{\"name\":\"2005 International Conference on Information and Communication Technologies\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 International Conference on Information and Communication Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT.2005.1598559\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 International Conference on Information and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT.2005.1598559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome Decoding Array (S.D.A).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
