Year: 2025
Type: article
Abstract: Circular-shift linear network coding (LNC) is a class of vector LNC with local encoding kernels selected from cyclic permutation matrices, so that it has low coding complexities. However, it is insufficient to exactly achieve the capacity of a multicast network, so the data units transmitted along the network need to contain redundant symbols, which affects the transmission efficiency. In this paper, as a variation of circular-shift LNC, we introduce a new class of vector LNC over arbitrary GF(p), calledcircular-shift-basedvector LNC, which is shown to be able to exactly achieve the capacity of a multicast network. The set of local encoding kernels in circular-shift-based vector LNC is nontrivially designed such that it is closed under multiplication by elements in itself. It turns out that the coding complexity of circular-shift-based vector LNC is comparable to and, in some cases, even lower than that of circular-shift LNC. The new results in the formulation of circular-shift-based vector LNC further facilitates us to characterize and design Vandermonde circulant maximum distance separable (MDS) array codes, which are built upon the structure of Vandermonde matrices and circular-shift operations. We prove that forr≥ 2, the largest possiblekfor anL-dimensional (k+r, k) Vandermonde circulantp-ary MDS array code ispmL− 1, whereLis an integer co-prime withp, andmLrepresents the multiplicative order ofpmoduloL. Forr∈ {2, 3}, we introduce two new types of (k+r, k) p-ary array codes that can achieve the largestk=pmL− 1. For the special case thatp= 2, we propose scheduling encoding algorithms for the 2 new codes, so that the encoding complexity not only asymptotically approaches the optimal 2 XORs per original data bit, but also slightly outperforms the encoding complexity of other known Vandermonde circulant MDS array codes with largestk= 2mL− 1.
Authors: Sheng Jin, Zhe Zhai, Qifu Tyler Sun, Haijun Zhang, Zongpeng Li
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: encoding complexity, multiplicative order
Open Access status: green
OpenAlex ID: W7092189125
