Johnson type bounds on constant dimension codes
Johnson type bounds on constant dimension codes
复制标题
常量尺寸代码上的 Johnson 类型界限
DOI：
10.1007/s10623-008-9221-7
复制
发表时间：
2007-09
影响因子：
1.6
通讯作者：
Fu, Fang-Wei
中科院分区：
文献类型：
--
作者：
Xia, Shu-Tao;Fu, Fang-Wei
最近，当Koetter和Kschischang研究随机网络编码时，操作员通道定义了。他们还引入了恒定的维度代码，并证明可以使用这些代码来纠正O上的错误和/或擦除。
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.
登录
查看更多内容
DOI：
10.1109/tit.2003.809567
发表时间：
2001-12
期刊：
--
影响因子：
--
作者：
Huaxiong Wang;C. Xing;R. Safavi-Naini
通讯作者：
Huaxiong Wang;C. Xing;R. Safavi-Naini
DOI：
10.1007/978-94-010-1220-1_16
发表时间：
1977
期刊：
Discret. Math.
影响因子：
--
作者：
J. H. Lint
通讯作者：
J. H. Lint
DOI：
10.1109/18.737544
发表时间：
1998-11
期刊：
IEEE Trans. Inf. Theory
影响因子：
--
作者：
T. Etzion
通讯作者：
T. Etzion
影响因子：
2.5
作者：
R. Koetter;F. Kschischang
通讯作者：
R. Koetter;F. Kschischang
影响因子：
--
作者：
I. Blake
通讯作者：
I. Blake