Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound

被引：3

作者：

De Beule, J. ^{[1
]}

Metsch, K. ^{[1
,2
]}

Storme, L.

机构：

[1] Univ Ghent, Dept Pure Math & Comp Algebra, B-9000 Ghent, Belgium

[2] Univ Giessen, Math Inst, D-35392 Giessen, Germany

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2008年 / 49卷 / 1-3期

关键词：

minihypers; Griesmer bound; blocking sets;

D O I：

10.1007/s10623-008-9191-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present characterization results on non-weighted minihypers. For minihypers in PG(k-1,q), q not a square, we improve greatly the results of Hamada, Helleseth, and Maekawa, and of Ferret and Storme. The largest improvements are obtained for q prime.

引用

页码：187 / 197

页数：11

共 50 条

[31] A class of optimal linear codes of length one above the Griesmer bound
E. J. Cheon
Designs, Codes and Cryptography, 2009, 51 : 9 - 20
[32] On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound
Li, Xiuli
ARS COMBINATORIA, 2009, 90 : 137 - 143
[33] Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric
Luo, Gaojun
Ezerman, Martianus Frederic
Guneri, Cem
Ling, San
Ozbudak, Ferruh
IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (11) : 7840 - 7847
[34] A CONSTRUCTION OF SOME [N, K, D Q]-CODES MEETING THE GRIESMER BOUND
TAMARI, F
DISCRETE MATHEMATICS, 1993, 116 (1-3) : 269 - 287
[35] A class of optimal linear codes of length one above the Griesmer bound
Cheon, E. J.
DESIGNS CODES AND CRYPTOGRAPHY, 2009, 51 (01) : 9 - 20
[36] A Griesmer bound for linear codes over finite quasi-Frobenius rings
Shiromoto, K
Storme, L
DISCRETE APPLIED MATHEMATICS, 2003, 128 (01) : 263 - 274
[37] A CHARACTERIZATION OF SOME [N, K, D Q]-CODES MEETING THE GRIESMER BOUND USING A MINIHYPER IN A FINITE PROJECTIVE GEOMETRY
HAMADA, N
DISCRETE MATHEMATICS, 1993, 116 (1-3) : 229 - 268
[38] Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
Simeon Ball
Szabolcs L. Fancsali
Designs, Codes and Cryptography, 2009, 53 : 119 - 136
[39] Multiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
Ball, Simeon
Fancsali, Szabolcs L.
DESIGNS CODES AND CRYPTOGRAPHY, 2009, 53 (02) : 119 - 136
[40] Weight Distributions of Divisible Codes Meeting the Griesmer Bound over F5 with Dimension 3
Liang, Fangchi
Ma, Yuena
Ku, Tao
PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION ENGINEERING, 2014, 111 : 146 - 148

← 1 2 3 4 5 →