On the Alphabet Size of A Linear Network Code

Nikolaos Pappas; Apostolos Traganitis

2nd International ICST Workshop on Cooperative Wireless Communications and Networking

Research Article

On the Alphabet Size of A Linear Network Code

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/BROADNETS.2008.4769042,
    author={Nikolaos Pappas and Apostolos Traganitis},
    title={On the Alphabet Size of A Linear Network Code},
    proceedings={2nd International ICST Workshop on Cooperative Wireless Communications and Networking},
    publisher={IEEE},
    proceedings_a={CONET},
    year={2010},
    month={5},
    keywords={Alphabet size  Galois Fields  Linear Network Coding},
    doi={10.1109/BROADNETS.2008.4769042}
}

Nikolaos Pappas
Apostolos Traganitis
Year: 2010
On the Alphabet Size of A Linear Network Code
CONET
IEEE
DOI: 10.1109/BROADNETS.2008.4769042

Nikolaos Pappas¹^,*, Apostolos Traganitis¹^,*

1: Telecommunications and Networks Lab, Institute of Computer Science, FORTH & Department of Computer Science, University of Crete. N. Plastira 100 Vassilika Vouton, GR-700 13 Heraklion, Crete, Greece.

*Contact email: npapas@ics.forth.gr, tragani@ics.forth.gr

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: Alphabet size Galois Fields Linear Network Coding

Published: 2010-05-16
Publisher: IEEE
Modified: 2010-05-16

: http://dx.doi.org/10.1109/BROADNETS.2008.4769042