Abstract
Network coding and requires multiplications and inversions over finite fields whose implementation complexity quickly increases with the field size. In this paper, the bound of finite field size is considered to reduce complexity by implement the random network coding in small field size. And some improved coding schemes are proposed to increase the decoding success rate in small field size. The simulation results proved that small field size is sufficient in some practice case. Then the fast random network coding with enough decoding success rate is achieved by the improved coding schemes with small field size in this paper.
Published Version
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.
