Network Coding Over The 232: 5 Prime Field

Morten Videbæk Pedersen, Janus Heide, Peter Vingelmann, Frank Fitzek

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

11 Citationer (Scopus)
541 Downloads (Pure)

Abstract

Creating efficient finite field implementations has been an active research topic for several decades. Many applications in areas such as cryptography, signal processing, erasure coding and now also network coding depend on this research to deliver satisfactory performance. In this paper we investigate the use of prime fields with a field size of 232 - 5, as this allows implementations which combines high field sizes and low complexity. First we introduce the algorithms needed to apply prime field arithmetics to arbitrary binary data. After this we present the initial throughput measurements from a benchmark application written in C++. These results are finally compared to different binary and binary extension field implementations. The results show that the prime field implementation offers a large field size while maintaining a very good performance. We believe that using prime fields will be useful in many network coding applications where large field sizes are required
OriginalsprogEngelsk
TitelCommunications (ICC), 2013 IEEE International Conference on
Antal sider6
ForlagIEEE
Publikationsdato2013
Sider2922 - 2927
ISBN (Trykt)978-1-4673-3122-7
DOI
StatusUdgivet - 2013
BegivenhedIEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) : IEEE ICC 2013 - Budapest, Ungarn
Varighed: 9 jun. 2013 → …

Workshop

WorkshopIEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5)
Land/OmrådeUngarn
ByBudapest
Periode09/06/2013 → …
NavnI E E E International Conference on Communications
ISSN1550-3607

Fingeraftryk

Dyk ned i forskningsemnerne om 'Network Coding Over The 232: 5 Prime Field'. Sammen danner de et unikt fingeraftryk.

Citationsformater