In this paper, an efficient and practical solution to cope with random linear network coding (RLNC) drawbacks and maximize the system throughput is proposed. No header overheads and no retransmissions are required as a result of the introduction of a unique codebook at the nodes in charge of RLNC coding and decoding. The codebook contains the seeds that allow for the pseudo-random generation of full-rank matrices of network coding elements over the finite Galois field GF(q), where q is the field size, for N generations. Each relay generates the same matrix and uses its corresponding row of N coding GF(q) coefficients. The destination, whose seeds codebook is synchronized on the same index value, generates the same full-rank matrix to decode the source nodes packets. Results show that the number of successfully transmitted packets is not generally affected by the choice of the generation size or the underlying finite field, which demonstrates the outperformance of the proposed technique over the traditional RLNC procedure.

在本文中，提出了一种有效且实用的解决方案来应对随机线性网络编码 (RLNC) 的缺点并最大化系统吞吐量。由于在负责 RLNC 编码和解码的节点处引入了唯一的码本，因此不需要报头开销和重传。码本包含允许在有限伽罗瓦域 GF( q ) 上伪随机生成网络编码元素的全秩矩阵的种子，其中q是N代的域大小。每个继电器生成相同的矩阵并使用其对应的N编码行GF( q) 系数。其种子码本在相同索引值上同步的目的地生成相同的满秩矩阵来解码源节点数据包。结果表明，成功传输的数据包数量通常不受生成大小或底层有限域选择的影响，这表明所提出的技术优于传统的 RLNC 程序。