Multicast Convolutional Network Codes via Local Encoding Kernels
A convolutional network (CN) code can be described by either global encoding kernels (GEKs) or local encoding kernels (LEKs). In the literature, the multicast property of a CN code is described using GEKs, so the design algorithms for multicast CN codes employ GEKs to check this property. For cyclic...
Main Authors: | Morteza Rekab-Eslami, Morteza Esmaeili, Thomas Aaron Gulliver |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7895122/ |
Similar Items
-
On maximum cycle packings in polyhedral graphs
by: Peter Recht, et al.
Published: (2014-04-01) -
Maximum Cycle Packing in Eulerian Graphs Using Local Traces
by: Recht Peter, et al.
Published: (2015-02-01) -
Metric Perspectives of the Ricci Flow Appliedto Disjoint Unions
by: Lakzian Sajjad, et al.
Published: (2014-01-01) -
Maximum cycle packing using SPR-trees
by: Christin Otto, et al.
Published: (2019-04-01) -
Graphs with Large Generalized (Edge-)Connectivity
by: Li Xueliang, et al.
Published: (2016-11-01)