The Multicast Solvability of Permutation Linear Network Coding

Permutation linear network coding (LNC) is a generalization of circular-shift LNC. It has a much richer supply of linear coding operations which can be efficiently implemented. It is known that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks. It would b...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 27; no. 1; p. 1
Main Authors: Tang, Hanqi, Zhai, Zhe, Sun, Qifu Tyler, Yang, Xiaolong
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Coding
Multicasting
Permutations
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Permutation linear network coding (LNC) is a generalization of circular-shift LNC. It has a much richer supply of linear coding operations which can be efficiently implemented. It is known that circular-shift LNC is insufficient to achieve the exact capacity of certain multicast networks. It would be natural to ask whether permutation LNC can achieve the exact capacity of every multicast network. In this paper, we prove that a multicast network has an L -dimensional permutation linear solution over a ring R if and only if it has a scalar linear solution over R. This result implies that the capacity of a multicast network not scalar linearly solvable over R cannot be exactly achieved by permutation LNC either. On the other hand, we unveil, by an explicit instance, the advantage of permutation LNC over circular-shift LNC in terms of the shorter block length to yield a linear solution at rate smaller than 1.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3210653