.png){kind=icon}
.png){kind=icon}
Return
On Encoding and Decoding of Circular-Shift Linear Network Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2905571.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a multicast network, a circular-shift linear code can be induced from a scalar linear code such that equipped with a nontrivially constructed source encoding matrix, and the induced code qualifies to be a circular-shift linear solution at a certain rate. However, for such an induced solution, there was no explicit characterization of the corresponding decoding matrix at every receiver. In this letter, we formulate a general rule to construct a source encoding matrix and a corresponding decoding matrix at every receiver. By application of the general rule, we further design new instances of the encoding and the decoding matrices, which can be expressed in a systematic form and involve fewer binary operations.
Keywords:
Network coding
circular-shift linear code
source encoding
decoding matrix
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available