MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations

Author(s)
Medard, Muriel; Lucani, Daniel Enrique; Stojanovic, Milica
Thumbnail
DownloadLucani-2009-Random Linear Network Coding for Time-Division Duplexing Field Size Considerations.pdf (195.6Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study the case of a node broadcasting to several receivers. We show that the effect of the field size can be included in the transition probabilities of the Markov chain model of the system. Also, an improved upper bound on the mean number of coded packets required to decode M original data packets using random linear network coding is presented. This bound shows that even if the field size is 2, i.e. we perform XORs amongst randomly selected packets from the pool of M original ones, we will need on average at most M + 2 coded packets in order to decode. Thus, there will be only a very small degradation in performance if M is large. We present numerical results showing that the mean completion time of our scheme with a field size of 2 is close in performance to our scheme when we use larger field sizes. We also show that as M increases, the difference between using a field size of 2 and larger field sizes decreases. Finally, we show that we can get very close to the optimal performance with small field sizes, e.g. a field size of 4 or 8, even when M is not very large.
Date issued
2009-11
URI
http://hdl.handle.net/1721.1/59978
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
Citation
Lucani, D.E., M. Medard, and M. Stojanovic. “Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations.” Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE. 2009. 1-6. ©2009 IEEE.
Version: Final published version
Other identifiers
INSPEC Accession Number: 11171036
ISBN
978-1-4244-4148-8
ISSN
1930-529X

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.