An Upper Bound of Singleton Type for Componentwise Products of Linear Codes

被引：17
|
作者：
Randriambololona, Hugues [1 ,2 ]
机构：
[1] Ecole Natl Super Telecommun Telecom ParisTech, F-75634 Paris 13, France
[2] LTCI CNRS UMR 5141, F-75634 Paris 13, France
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2013年 / 59卷 / 12期
关键词：
Componentwise product; linear code; upper bound;
D O I：
10.1109/TIT.2013.2281145
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give an upper bound that relates the dimensions of some given number of linear codes, with the minimum distance of their componentwise product. A typical result is as follows: given t linear codes C-i of parameters [n, k(i)](q) with full support, one can find codewords c(i) epsilon C-i such that 1 <= w(c(1) * ... * c(t)) <= max(t = 1, n + t - (k(1) + ... + k(t))).
引用
收藏
页码：7936 / 7939
页数：4
相关论文
共 50 条
12345