Multi-bit revocable network coding scheme for butterfly-like network

This paper argues a network coding scheme with revocation. ‘Revocation’ 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.