Improving the Gilbert-Varshamov Bound by Graph Spectral Method

被引:0
作者
Ye, Zicheng [1 ,2 ]
Zhang, Huazi [3 ]
Li, Rong [3 ]
Wang, Jun [3 ]
Yan, Guiying [1 ,2 ]
Ma, Zhiming [1 ,2 ]
机构
[1] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[3] Hangzhou Res Ctr Huawei Technol Co Ltd, Hangzhou 310052, Zhejiang, Peoples R China
来源
CSIAM TRANSACTIONS ON APPLIED MATHEMATICS | 2023年 / 4卷 / 01期
关键词
Gilbert-Varshamov bound; independence number; graph spectral method; Cayley graph; linear codes; CODES;
D O I
10.4208/csiam-am.SO-2021-0024
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph G(q,n,d) is a graph with all vectors in F-q(n) as vertices where two vertices are adjacent if their Hamming distance is less than d. In this paper, we calculate the eigenvalues and eigenvectors of G(q,n,d) using the properties of Cayley graph. The improved bound is associated with the minimum eigenvalue of the graph. Finally we give an algorithm to calculate the bound and linear codes which satisfy the bound.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 38 条
[31]   Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes [J].
Zhang C. ;
Shangguan C. ;
Ge G. .
IEEE Transactions on Information Theory, 2023, 69 (11) :7099-7109
[32]   Gilbert-Varshamov-type bound for relative dimension length profile [J].
Matsumoto, Ryutaroh .
IEICE COMMUNICATIONS EXPRESS, 2013, 2 (08) :343-346
[33]   Extended Varshamov-Gilbert-Sacks Bound for Linear Lee Weight Codes [J].
Jain, Sapna ;
Shum, K. P. .
ALGEBRA COLLOQUIUM, 2012, 19 :893-904
[34]   Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds [J].
Xing, CP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) :347-352
[35]   Alphabet Size Matching Techniques Based on Non-Binary Gilbert-Varshamov Bounded Limits for Synchronization Finite State Markov Channel [J].
Achari, Shamin ;
Cheng, Ling .
IEEE ACCESS, 2023, 11 :8324-8331
[36]   Sequential fuzzy cluster extraction by a graph spectral method [J].
Inoue, K ;
Urahama, K .
PATTERN RECOGNITION LETTERS, 1999, 20 (07) :699-705
[37]   Features Fxtraction of Prostate with Graph Spectral Method for Prostate Cancer Detection [J].
Du, Weiwei ;
Liu, Yi-peng ;
Wang, Shiyang ;
Peng, Yahui ;
Oto, Aytekin .
2016 17TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2016, :663-668
[38]   Improving the Upper Bound of Error Probability for Polarized Multiple Access Channels Via a New Method [J].
Pakravan, Saeid ;
Tavakoli, Hassan .
26TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE 2018), 2018, :532-537