Rongquan Feng

Learn 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)
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)
Hofmeister introduced the notion of a concrete (resp., concrete regular) covering of a graph G and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of G [Ars Combin., 32 (1991), pp. 121–127; SIAM J. Discrete Math., 8 (1995), pp. 51–61]. In this paper, we show that the number of the isomorphism classes of(More)
This paper presents a new model of ordinary elliptic curves with fast arithmetic over field of characteristic two. In addition, we propose two isomorphism maps between new curves and Weierstrass curves. This paper proposes new explicit addition law for new binary curves and prove the addition law corresponds to the usual addition law on Weierstrass curves.(More)
Digital signals are complex-valued functions on Z n . Signal sets with certain properties are required in various communication systems. Traditional signal sets consider only the time distortion during transmission. Recently, signal sets taking care of both the time and phase distortion have been studied, and are called time-phase signal sets. Several(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. Recently, C. C. Wang and(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 error(More)
In this paper, the twisted Jacobi intersections which contains Jacobi intersections as a special case is introduced. We show that every elliptic curve over the prime field with three points of order 2 is isomorphic to a twisted Jacobi intersections curve. Some fast explicit formulae for twisted Jacobi intersections curves in projective coordinates are(More)