Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it ...Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it is found that there are similar results for variable-rate linear generic and linear dispersion if the field size is large enough.It means that linear generics and linear dispersions of different dimensions can be implemented on the same network,while each non-source node is required to store only one copy of the local encoding kernel within a session.Moreover,an example is given to show that there isn't a similar result for linear multicast.展开更多
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is hom...In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.展开更多
基金Sponsored by the National Natural Science Foundation of China and the Research Grants Council of Hong Kong Joint Research Scheme(Grant No.60731160626)the National Natural Science Foundation of China(Grant No.60821001and61003287)+1 种基金the 111 Project(Grant No.B08004)the Fundamental Research Funds for the Central Universities(Grant No.BUPT2009RC0220)
文摘Fong et al.analyzed variable-rate linear network coding for linear broadcast.However,the authors didn't investigate it for the other three types of linear network codes.In this paper,by simple and clear proofs,it is found that there are similar results for variable-rate linear generic and linear dispersion if the field size is large enough.It means that linear generics and linear dispersions of different dimensions can be implemented on the same network,while each non-source node is required to store only one copy of the local encoding kernel within a session.Moreover,an example is given to show that there isn't a similar result for linear multicast.
基金supported by Natural Science Foundation of China (No.61271258)
文摘In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.
