Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Systematic Binary Deterministic Rateless Codes
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
2008 (English)In: 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, NEW YORK: IEEE , 2008, 2066-2070 p.Conference paper, Published paper (Refereed)
Abstract [en]

We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes are for networks with erasure channels. With a maximum distance separable (MDS) property, non-systematic BDRCs were first proposed in [1] with encoding complexity O(K), and decoding complexity is O(K-2). Here K is the length of information bits. To reduce complexity, we study systematic-BDRCs (SBDRCs). For SBDRCs, the source first transmits m - 1 uncoded blocks, where m is the number of source blocks. Then, the source produces and transmits coded blocks in a rateless way. These coded blocks are produced using only cyclic-shift and XOR (exclusive or). The SBDRCs can use a large number of information blocks (potentially infinite m). On receiving any m distinct blocks (uncoded or coded), a sink can rebuild the source. The SBDRCs have encoding complexity O(epsilon K), and decoding complexity O(epsilon(2) K-2), where epsilon is the source-to-sink block erasure probability.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2008. 2066-2070 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-28961DOI: 10.1109/ISIT.2008.4595353ISI: 000260364401136Scopus ID: 2-s2.0-52349110736ISBN: 978-1-4244-2256-2 (print)OAI: oai:DiVA.org:kth-28961DiVA: diva2:398546
Conference
IEEE International Symposium on Information Theory Toronto, CANADA, JUL 06-11, 2008
Note
QC 20110218Available from: 2011-02-18 Created: 2011-01-25 Last updated: 2011-02-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, Ming

Search in DiVA

By author/editor
Xiao, Ming
By organisation
Communication TheoryACCESS Linnaeus Centre
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 35 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf