.png){kind=icon}
.png){kind=icon}
Return
Generic Linear Network Code Construction Using Transversal Matroids
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2619706.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A generic linear network (GLN) code is the strongest linear network code in terms of the linear independence of the coding vectors. It can be designed by constructing a representation matrix for a transversal matroid. Recently, a new algorithm for constructing this matrix has been developed. In this letter, we present details on the method of constructing a GLN code using transversal matroids, compute the time complexity of this method, and compare it with other algorithms.
Keywords:
Generic linear network codes
bipartite graphs
representation matrix
transversal matroids
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