Abstract
An interesting application of coding theory in network routing is presented. Certain error-correcting codes can be employed to specify a minimal subset of nodes called “stations” which are at distancetfrom the rest of the nodes. The stations, acting as relay agents, can then broadcast data/control information from a central controller to all the nodes (or conversely from the nodes to the central controller) in no more thantsteps. The network considered is theq-aryn-dimensional hypercube. The study shows that for a givent, perfect codes yield the minimal set of stations whereas quasi-perfect codes render suboptimal solutions.
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.
