The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a practical and general coder and decoder of network coding (NC) with HDL (Hardware Description Language) logic for wire-speed nodes in multisource multicast networks. The NC coders apply random linear network coding (RLNC) and the decoders recover the original packets by Cramer's rule. All these mathematical operations are carried out in the Galois Field (256). The structures...
Capacity of network coding in cyclic networks can be strictly better than routing. Harvey et al. showed that it exists in the practical scenarios such as the widespread P2P networks. Thus, it is of application significance to investigate how to construct network code in cyclic networks. According to Li et al., there are four levels of network code in cyclic networks, including convolutional multicast...
Network coding in cyclic networks may have better performance than network coding in acyclic networks with regard to the multi-unicast scenarios. Harvey et al. showed that network coding in cyclic networks can be strictly better than fractional routing in conservative networks which have widely practical scenarios such as P2P networks. Hence, we motivated investigating how to achieve that better performance...
Quantitative complexity of network coding as well as its computation delay on a node is presented in this paper. First, quantitative complexity of four fundamental calculation operations were analyzed. Based on that, quantitative complexity of encoding, decoding as well as independence detection for network coding were given theoretically. At last, the experimental results showed our quantitative...
Network coding in cyclic networks meets more problems than in acyclic networks. Recently, S.-Y.R.Li et al.proposed a framework of convolutional network coding (CNC) as well as its four properties for cyclic networks with theoretic fundamentals of discrete valuation ring (DVR). The four properties, convolutional multicast (CM), convolutional broadcast (CB), convolutional dispersion (CD) and basic convolutional...
This work addresses the application of network coding on cyclic networks. Cycles and delay are indispensable factors when designing and implementing data networks. However, most attention in the literature of network coding has been on acyclic networks. Hence, in order to bridge the gap of network coding and the practical networks, Convolutional Network Coding (CNC) with delay as an essential part...
The traditional error control coding of channel has no long satisfied the requirement of the deep space communication, because of the long delay, great error rate, probability of packet loss, links easily interrupted and so on. The Fountain codes, used in deep space communication, has been introduced and analyzed. The coding and decoding process of LT codes of Fountain codes has been introduced and...
The features of long delay, great error rate and packet loss, asymmetric bandwidth between uplink and downlink and links easily interrupted in deep space communication determine the technology of encoding and decoding is a difficult issue. The basic conception and features of fountain codes are introduced, and the question of all-selected, degree distribution and the decoding algorithm of fountain...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.