Abstract
To solve problem that cannot be coded, which is inherent in the linear broadcast and linear dispersion,this paper proposes a new type of linear network code—the strict linear dispersion. A construction algorithm isproposed and it proves that the demanded finite field size is not higher than that of linear dispersion. Moreover,some special transition matrices are defined and the transition feasibility from linear dispersion to strict linear dispersion is proved. If combined with a special packetization strategy, the strict linear dispersion can presentadvantages over linear dispersion when applied in heterogeneous networks. It can also realize multi-ratetransmission with a single network code session and provide convenience to the construction of network code on the extended network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
