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 条

[1] On products and powers of linear codes under componentwise multiplication
Randriambololona, Hugues
ALGORITHMIC ARITHMETIC, GEOMETRY, AND CODING THEORY, 2015, 637 : 3 - 78
[2] Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes
Ji, Qinqin
Zheng, Dabin
Chen, Hao
Wang, Xiaoqiang
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2900 - 2910
[3] On singleton-type bound of locally repairable codes
Lin, Xing
Cai, Han
Tang, Xiaohu
DISCRETE MATHEMATICS, 2024, 347 (07)
[4] Construction of linear network codes that achieve a refined Singleton bound
Yang, Shenghao
Ngai, Chi Kin
Yeung, Raymond W.
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1576 - 1580
[5] Singleton's Bound in Euclidean Codes
Jain, Sapna
ALGEBRA COLLOQUIUM, 2010, 17 : 741 - 748
[6] An Upper Bound on the Separating Redundancy of Linear Block Codes
Abdel-Ghaffar, Khaled A. S.
Weber, Jos H.
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1173 - 1177
[7] A tight upper bound on the BER of linear systematic block codes
Vitthaladevuni, PK
Alouini, MS
IEEE COMMUNICATIONS LETTERS, 2004, 8 (05) : 299 - 301
[8] A New Upper Bound on the Error Probability of Binary Linear Codes
Guo, Jun
Dai, Liyun
Yang, Hongwen
MEMS, NANO AND SMART SYSTEMS, PTS 1-6, 2012, 403-408 : 2852 - 2855
[9] Componentwise ultimate bound computation for switched linear systems
Haimovich, Hernan
Seron, Maria M.
PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 2150 - 2155
[10] On subsystem codes beating the quantum Hamming or Singleton bound
Klappenecker, Andreas
Sarvepalli, Pradeep Kiran
PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2007, 463 (2087): : 2887 - 2905

← 1 2 3 4 5 →