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 条

[41] UPPER BOUND FOR SELF-DUAL CODES
MALLOWS, CL
SLOANE, NJA
INFORMATION AND CONTROL, 1973, 22 (02): : 188 - 200
[42] An upper bound on the minimum weight of Type II Z2k-codes
Harada, Masaaki
Miezaki, Tsuyoshi
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (01) : 190 - 196
[43] Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
Liu, Jia
Zhang, Mingyu
Wang, Chaoyong
Chen, Rongjun
An, Xiaofeng
Wang, Yufei
DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2020, 2020
[44] Construction algorithm for network error-correcting codes attaining the singleton bound
Matsumoto, Ryutaroh
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (09) : 1729 - 1735
[45] ENTANGLEMENT-ASSISTED QUANTUM CODES ACHIEVING THE QUANTUM SINGLETON BOUND BUT VIOLATING THE QUANTUM HAMMING BOUND
Li, Ruihu
Guo, Luobin
Xu, Zongben
QUANTUM INFORMATION & COMPUTATION, 2014, 14 (13-14) : 1107 - 1116
[46] Eigenstructure Assignment for Componentwise Ultimate Bound Minimization in Discrete-Time Linear Systems
Heidari, Rahmat
Seron, Maria M.
Braslavsky, Julio H.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (11) : 3669 - 3675
[47] Upper Bounds for Linear Graph Codes
Versteegen, Leo
RANDOM STRUCTURES & ALGORITHMS, 2024,
[48] Singleton-type bounds for blot-correcting codes
Univ of Ulm, Ulm, Germany
IEEE Trans Inf Theory, 3 (1021-1023):
[49] Singleton-type bounds for blot-correcting codes
Bossert, M
Sidorenko, V
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 1021 - 1023
[50] Decoding complexity bound for linear block codes
Kruk, E.A.
Problems of information transmission, 1990, 25 (03) : 251 - 254

← 1 2 3 4 5 →