Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network

Zhao, Xubo; Guo, Wangmei

doi:10.1587/transfun.e95.a.1570

Cited by 3 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is an edge (s, e) in N if in N, e is an outgoing edge of source node s. There is an edge (e, r i ) in N if in N, e is an incoming edge of sink node r i . Clearly, the LEK l d,e for the adjacent pair (d, e) in N corresponds to the LEK for the edge (d, e) in N, and the associated GEK g e of edge e in N just corresponds to the associated GEK of node e in N. The graphical representation of LEKs and GEKs on line graph N can be found in [11]. It is also obviously that if there are ω edges disjoint paths between source s and sink r in N, there are corresponding ω nodes disjoint paths in N.…”

Section: Preliminariesmentioning

confidence: 99%

See 1 more Smart Citation

A Straight Construction Algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks

Zhao

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

Delay invariant convolutional network codes (abbreviated DI-CNCs) can guarantee multicast communication at asymptotically optimal rates in networks with any delay profile. For a cyclic network, it has been shown that one can associate it with an acyclic network consisting of nodes in five layers, and the acyclic algorithm of F-linear multicast can be employed to construct a DI-F-CNC, as long as the field size is larger than the number of sinks in the cyclic network. In this paper, we present a directly feasible construction algorithm for a DI-F-CNC over a cyclic network. Complexity of code construction and theoretical guarantees of algorithm implementation are also investigated in detail. The advantage of the straight construction algorithm is that for an existing code, when some sink nodes and associated edges are added, our algorithm just modifies the new assigned coding coefficients in an efficient localized manner, without the necessity to construct again the code in its expanding network.

show abstract

Section: Preliminariesmentioning

confidence: 99%

“…Initially, [11][12][13]. Note that when we process the nodes in P 1 , the matrix I − K is upper triangular and on its diagonal all elements are equal to 1, then det(I − K) = 1 0.…”

Section: An Example Network To Illustrate Di-f-cnc Construction Algor...mentioning

confidence: 99%

A Straight Construction Algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks

Zhao

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

An efficient basic convolutional network code construction algorithm on cyclic networks

Zhao

2013

AEU - International Journal of Electronics and Communications

View full text Add to dashboard Cite

Multicast Convolutional Network Codes via Local Encoding Kernels

2017

View full text Add to dashboard Cite

Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network

Cited by 3 publications

References 5 publications

A Straight Construction Algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks

A Straight Construction Algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks

An efficient basic convolutional network code construction algorithm on cyclic networks

Multicast Convolutional Network Codes via Local Encoding Kernels

Contact Info

Product

Resources

About