Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks

Published:2020-11 Issue:11 Volume:66 Page:6786-6798
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Cai Han^ORCID,Chrisnata Johan^ORCID,Etzion Tuvi^ORCID,Schwartz Moshe^ORCID,Wachter-Zeh Antonia^ORCID

Funder

Bernard Elkin Chair in Computer Science

German Israeli Project Cooperation (DIP) Grant

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

http://xplorestaging.ieee.org/ielx7/18/9234771/09097246.pdf?arnumber=9097246

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounds on the Minimum Field Size of Network MDS Codes;IEEE Transactions on Information Theory;2024-08

2. On Duplication-Free Codes for Disjoint or Equal-Length Errors;2024-01-17

3. A Serial Game Distributed Algorithm to $\epsilon$-Minimum Vertex Cover of Networks in Finite Time;IEEE Transactions on Automation Science and Engineering;2024

4. Almost affinely disjoint subspaces and covering Grassmannian codes;Finite Fields and Their Applications;2023-12

5. Covering Grassmannian Codes: Bounds and Constructions;IEEE Transactions on Information Theory;2023-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP