Title :
On the alphabet size of a linear network code
Author :
Pappas, Nikolaos ; Traganitis, Apostolos
Author_Institution :
FORTH & Dept. of Comput. Sci., Univ. of Crete, Heraklion
Abstract :
The alphabet size of a network code is a crucial parameter for the existence of a code in a network topology. In this paper we present a method to compute the alphabet size of a linear network code for an one-source acyclic directed graph using only the outgoing edges from the source. In addition we show a method to reduce the alphabet size for a class of combination networks.
Keywords :
Galois fields; encoding; graph theory; network topology; Galois fields; alphabet size; linear network code; network topology; one-source acyclic directed graph; Computer networks; Computer science; Decoding; Delay; Encoding; Galois fields; Multicast algorithms; NP-hard problem; Network coding; Network topology; Alphabet size; Galois Fields; Linear Network Coding;
Conference_Titel :
Broadband Communications, Networks and Systems, 2008. BROADNETS 2008. 5th International Conference on
Conference_Location :
London
Print_ISBN :
978-1-4244-2391-0
Electronic_ISBN :
978-1-4244-2392-7
DOI :
10.1109/BROADNETS.2008.4769042
