.png){kind=icon}
返回
Generic Linear Network Code Construction Using Transversal Matroids
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2619706.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Generic linear network codes
bipartite graphs
representation matrix
transversal matroids
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
Raman spectroscopy probing of self-assembled monolayers inside the pores of gold nanotube membranes
PREAI
分享收藏分享收藏
没有更多内容
没有更多内容