Systematic Binary Deterministic Rateless Codes
2008 (English)In: 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, NEW YORK: IEEE , 2008, 2066-2070 p.Conference paper (Refereed)
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  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.
IdentifiersURN: urn:nbn:se:kth:diva-28961DOI: 10.1109/ISIT.2008.4595353ISI: 000260364401136ScopusID: 2-s2.0-52349110736ISBN: 978-1-4244-2256-2OAI: oai:DiVA.org:kth-28961DiVA: diva2:398546
IEEE International Symposium on Information Theory Toronto, CANADA, JUL 06-11, 2008
QC 201102182011-02-182011-01-252011-02-18Bibliographically approved