{"title":"蝶形网络的多比特可撤销网络编码方案","authors":"H. Kuwakado, M. Mori","doi":"10.1109/ISITA.2008.4895450","DOIUrl":null,"url":null,"abstract":"This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-bit revocable network coding scheme for butterfly-like network\",\"authors\":\"H. Kuwakado, M. Mori\",\"doi\":\"10.1109/ISITA.2008.4895450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895450\",\"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 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-bit revocable network coding scheme for butterfly-like network
This paper argues a network coding scheme with revocation. dasiaRevocationpsila means that a source can dynamically select sinks that cannot obtain information, and even if revoked sinks are changed, encoding rules of all nodes are unchanged. This scheme is called a revocable network coding scheme. For butterfly-like networks, only a one-bit revocable network coding scheme was studied. In this paper, we first introduce two network models for revocation. We next propose multi-bit revocable network coding schemes for butterfly-like networks on two network models.