{"title":"常维码的Graham-Sloane型构造","authors":"Shutao Xia","doi":"10.1109/NETCOD.2008.4476190","DOIUrl":null,"url":null,"abstract":"Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. In this paper, a Graham-Sloane type construction of constant dimension codes is presented. It is shown that the construction for the case of minimum dimension distance 4 exceeds the Gilbert type lower bound for constant dimension codes.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Graham-Sloane Type Construction of Constant Dimension Codes\",\"authors\":\"Shutao Xia\",\"doi\":\"10.1109/NETCOD.2008.4476190\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. In this paper, a Graham-Sloane type construction of constant dimension codes is presented. It is shown that the construction for the case of minimum dimension distance 4 exceeds the Gilbert type lower bound for constant dimension codes.\",\"PeriodicalId\":186056,\"journal\":{\"name\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2008.4476190\",\"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 Fourth Workshop on Network Coding, Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2008.4476190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Graham-Sloane Type Construction of Constant Dimension Codes
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. In this paper, a Graham-Sloane type construction of constant dimension codes is presented. It is shown that the construction for the case of minimum dimension distance 4 exceeds the Gilbert type lower bound for constant dimension codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
