Learn More
—The encoding complexity for network coding with one multicast session has been intensively studied from several aspects: e.g., the time complexity, the required number of encoding links and the required field size for a linear code solution. However, these issues are less understood for the network with multiple multicast sessions. declared that polynomial(More)
In this paper, we present the generalized Huff curves that contain Huff’s model as a special case. First, it is proved that every elliptic curve with three points of order 2 is isomorphic to a generalized Huff curve. Then, the fast and explicit formulae are derived for generalized Huff curves in projective coordinates. This paper also enumerates the number(More)
—This paper considers the problem of error correction for a cooperative data exchange (CDE) system, where some clients are compromised or failed and send false messages. Assuming each client possesses a subset of the total messages, we analyze the error correction capability when every client is allowed to broadcast only one linearly-coded message. Our(More)
In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair unicast problem. It is shown that the solvability of a 2-pair unicast problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to(More)
In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some(More)
Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which ÿx a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175)(More)