TY - GEN
T1 - Hybrid random network coding
AU - Ik, Tsi-Ui
PY - 2011/9/5
Y1 - 2011/9/5
N2 - To avoid possible dependence among coded packets, most research works of random linear network coding suggest encoding packets over a Galois field with enough many elements, e.g., GF (28) or GF (216). However, Galois operations are with higher computational cost than ordinary integer operations. On the other hand, random Boolean network coding, based on the Boolean algebra in which XOR is the only operation needed for encoding and encoding, is a computation-friendly random network coding scheme but at the same time suffered for the possible dependence among coded packets. In this work, a hybrid coding scheme is proposed. Most coded packets are encoded over the Boolean field and only a few augmented coded packets, more precisely 4 packets, are needed to be encoded over the Galois field. Both the computational efficiency and bandwidth effectiveness are taken into consideration. The proposed scheme is theoretically verified by probabilistic analysis.
AB - To avoid possible dependence among coded packets, most research works of random linear network coding suggest encoding packets over a Galois field with enough many elements, e.g., GF (28) or GF (216). However, Galois operations are with higher computational cost than ordinary integer operations. On the other hand, random Boolean network coding, based on the Boolean algebra in which XOR is the only operation needed for encoding and encoding, is a computation-friendly random network coding scheme but at the same time suffered for the possible dependence among coded packets. In this work, a hybrid coding scheme is proposed. Most coded packets are encoded over the Boolean field and only a few augmented coded packets, more precisely 4 packets, are needed to be encoded over the Galois field. Both the computational efficiency and bandwidth effectiveness are taken into consideration. The proposed scheme is theoretically verified by probabilistic analysis.
KW - Boolean field
KW - Galois fields
KW - Hybrid random network coding
KW - random Boolean network coding
KW - random linear network coding
KW - random rank
UR - http://www.scopus.com/inward/record.url?scp=80052201765&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23490-3_18
DO - 10.1007/978-3-642-23490-3_18
M3 - Conference contribution
AN - SCOPUS:80052201765
SN - 9783642234897
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 202
EP - 210
BT - Wireless Algorithms, Systems, and Applications - 6th International Conference, WASA 2011, Proceedings
T2 - 6th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2011
Y2 - 11 August 2011 through 13 August 2011
ER -