Bounds on cardinality of multicomponent network codes

2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems Pub Date : 2014-06-01 DOI:10.1109/RED.2014.7016694

V. Afanassiev, E. Gabidulin, N. Pilipchuk

引用次数: 1

Abstract

Network coding is a new direction of communications and information theory. Algebraic coding in this area is based on Grassmann metric known also as subspace metric. The paper is devoted to some bounds on cardinality of codes in Grassmann metric.

查看原文本刊更多论文

多分量网络码的基数边界

网络编码是通信与信息理论研究的一个新方向。该领域的代数编码基于格拉斯曼度量，也称为子空间度量。本文研究了格拉斯曼度量中码的基数的一些界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems

自引率

0.00%

发文量