New construction of quasi-twisted two-weight codes and related strongly regular graphs
DOI:
https://doi.org/10.13069/jacodesmath.v14i1.406Keywords:
Coding theory, Linear codes, Quasi-twisted codes, Two-weight codes, Strongly regular graphs, Mixed integer programmingAbstract
Two-weight codes can be used to construct secret sharing systems and to obtain strongly regular graphs. To construct new two-weight codes is a difficult problem. In this paper, a mixed integer programming model is presented to find quasi-twisted two-weight codes. A lot of quasi-twisted two-weight codes have been obtained. The new two-weight codes and their corresponding strongly regular graphs are presented.
Received: 08 September 2025 | Revised: 16 June 2026 | Accepted: 27 June 2026
Downloads
References
N. Aydin and I. Siap, New quasi-cyclic codes over $\mathbb{F}_{5}$, Appl. Math. Lett. 15(7) (2002) 833–836.
N. Aydin, I. Siap, and D. Ray-Chaudhuri, The structure of 1-generator quasi-twisted codes and new linear codes, Des. Codes Cryptogr. 24 (2001) 313–326.
W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24(3--4) (1997) 235–265.
I. Bouyukliev, V. Fack, W. Willems, and J. Winne, Projective two-weight codes with small parameters and their corresponding graphs, Des. Codes Cryptogr. 41 (2006) 59–78.
P. Boyvalenkov, K. Delchev, D. V. Zinoviev, and V. A. Zinoviev, On two-weight codes, Discrete Math. 344(5) (2021) 112318.
A. E. Brouwer and H. Van Maldeghem, Strongly Regular Graphs, Encyclopedia of Mathematics and its Applications, Chapter 7, Cambridge University Press, Cambridge (2022).
R. Calderbank and W. M. Kantor, The geometry of two-weight codes, Bull. London Math. Soc. 18(2) (1986) 97–122.
E. Z. Chen, Six new binary quasi-cyclic codes, IEEE Trans. Inform. Theory 40(5) (1994) 1666–1667.
E. Z. Chen, A new iterative computer search algorithm for good quasi-twisted codes, 76 (2015) 307–323.
E. Z. Chen, Database of two-weight codes, Available online at \url{http://databases.cs.hkr.se/2weightcodes/search.php}, Accessed: 14 September 2026 (2024).
C. L. Chen, W. W. Peterson, and J. E. J. Weldon, Some results on quasi-cyclic codes, Information and Control 15(5) (1969) 407–423.
F. Clautiaux and I. Ljubić, Last fifty years of integer linear programming: A focus on recent practical advances, European J. Oper. Res. 324(3) (2025) 707–731.
R. Daskalov and P. Hristov, New quasi-twisted degenerate ternary linear codes, IEEE Trans. Inform. Theory 49(9) (2003) 2259–2263.
P. Delsarte, Weights of linear codes and strongly regular normed spaces, Discrete Math. 3(1--3) (1972) 47–64.
T. A. Gulliver, A new two-weight code and strongly regular graph, Appl. Math. Lett. 9(2) (1996) 17–20.
T. A. Gulliver, Two new optimal ternary two-weight codes and strongly regular graphs, Discrete Math. 149(1) (1996) 83–92.
T. A. Gulliver and V. K. Bhargava, Some best rate $1/p$ and rate $(p-1)/p$ systematic quasi-cyclic codes, IEEE Trans. Inform. Theory 37(3) (1991) 552–555.
T. A. Gulliver and V. K. Bhargava, Nine good rate (m-1)/pm quasi-cyclic codes, IEEE Trans. Inform. Theory 38(4) (1992) 1366–1369.
T. A. Gulliver and P. R. J. Östergård, New binary linear codes, Ars Combin. 56 (2000) 105–112.
P. Heijnen, H. van Tilborg, T. Verhoeff, and S. Weijs, Some new binary, quasi-cyclic codes, IEEE Trans. Inform. Theory 44(5) (1998) 1994–1996.
Z. Heng, D. Li, J. Du, and F. Chen, A family of projective two-weight linear codes, Des. Codes Cryptogr. 89 (2021) 1993–2007.
IBM Corp., IBM ILOG CPLEX optimization studio, Available online at \url{https://www.ibm.com/products/ilog-cplex-optimization-studio}, Accessed: 14 September 2026 (2024).
I. O. Mathematics and B. A. O. S. Informatics, Codes and combinatorial configurations, Available online at \url{https://www.moi.math.bas.bg/moiuser/~data/Results/LinearCodes/TwoWeightCodes.html}, Accessed: 14 September 2026 (2025).
A. Kohnert, Constructing two-weight codes with prescribed groups of automorphisms, Discrete Appl. Math. 155(11) (2007) 1451–1457.
S. Kurz, Non-projective two-weight codes, Entropy 26(4) (2024) 289.
G. E. Séguin and G. Drolet, The theory of 1-generator quasi-cyclic codes, Preprint (1990).
H. van Tilborg, On quasi-cyclic codes with rate $1/m$ (corresp.), IEEE Trans. Inform. Theory 24(5) (1978) 628–630.
J. Yuan and C. Ding, Secret sharing schemes from three classes of linear codes, IEEE Trans. Inform. Theory 52(1) (2006) 206–212.
