| 摘要 |
A mesh communication network comprising source nodes, relay nodes and destination nodes (s1-8) codes Time Division Multiplexed (TDMA) source packets (p1-24) group by group for linear combination with redundant packets at relay nodes to create combined packets (510-560, fig. 5A) which are relayed by specific node sets (515-565, fig. 5B), thus coding the network with enough redundancy to provide a minimum robustness R without unduly limiting bandwidth. Source data packets are divided into groups of maximum size K, each having optimal source node diversity, and combined using a generator matrix G having P rows and K columns of Galois field coefficients αij (340, fig. 3). Each destination node recovers the source packets from the combined packets via the Gauss-Jordan algorithm |
