On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound

被引：3

作者：

Bassalygo, Leonid ^{[1
]}

Dodunekov, Stefan ^{[2
]}

Helleseth, Tor ^{[3
]}

Zinoviev, Victor ^{[1
]}

机构：

[1] Russian Acad Sci, Inst Problems Informat Transmiss, Bolshol Karetnyi Per 19,GSP-4, Moscow 101447, Russia

[2] Bulgarian Acad Sci, Inst Math & Informat, Sofia 1113, Bulgaria

[3] Univ Bergen, Selmer Ctr, Dept Informat, N-5020 Bergen, Norway

来源：

2006 IEEE INFORMATION THEORY WORKSHOP | 2006年

关键词：

D O I：

10.1109/ITW.2006.1633829

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

For any integer q we present a new bound which is a q-ary combinatorial analog of the binary Grey-Rankin bound. For any prime power q we present two infinite classes of q-ary codes which meet this bound with integral equality. Moreover, we show how codes meeting this bound with equality are connected to several important classical combinatorial configurations, such as difference matrices and generalized Hadamard matrices.

引用

页码：278 / +

页数：2

共 50 条

[41] Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences
Univ of Southern California, Los Angeles, United States
IEEE Trans Inf Theory, 1 (250-254):
[42] Coded error performance bound for Q-ary PPM signaling over the satellite-to-ground optical channel
Liao, Huixi
Zhang, Qingjun
Tan, Liying
OPTIK, 2013, 124 (13): : 1486 - 1489
[43] Non-Binary Low-Density Parity-Check Codes for the q-ary Erasure Channel
Garrammone, Giuliano
Paolini, Enrico
Matuz, Balazs
Liva, Gianluigi
Chiani, Marco
2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2013, : 3258 - 3263
[44] A CONSTRUCTION OF SOME [N, K, D Q]-CODES MEETING THE GRIESMER BOUND
TAMARI, F
DISCRETE MATHEMATICS, 1993, 116 (1-3) : 269 - 287
[45] A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES
冯贵良
Journal of Electronics(China), 1985, (03) : 188 - 194
[46] A new upper bound on the rate of non-binary codes
Ben-Haim, Yael
Litsyn, Simon
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2007, 1 (01) : 83 - 92
[47] A new upper bound on the rate of non-binary codes
Ben-Haim, Yael
Litsyn, Simon
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 297 - 301
[48] New upper bound for binary codes with minimum distance four
Kim, JK
Hahn, SG
DISCRETE MATHEMATICS, 1998, 187 (1-3) : 291 - 295
[49] 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
[50] Analysis of Error Floors of Generalized Non-binary LDPC Codes over q-ary Memoryless Symmetric Channels
Nozaki, Takayuki
Kasai, Kenta
Sakaniwa, Kohichi
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,

← 1 2 3 4 5 →