American Institute of Mathematical Sciences

doi: 10.3934/amc.2020106

Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros

 1 College of Mathematics and Statistics, Northwest Normal University, Lanzhou, Gansu 730070, China 2 Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin, Guangxi 541004, China 3 School of Mathematics and Information, China West Normal University, Nanchong, Sichuan 637002, China 4 Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, Guangdong 518055, China

* Corresponding author: Rong Wang

Received  May 2020 Published  August 2020

Fund Project: Xiaoni Du's research is supported by NSFC grant No. 61772022. Chunming Tang's research is supported by NSFC Grant No. 11871058. Qi Wang's research is supported by NSFC Grant No. 61672015

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs from codes has been done. In this paper, we determine the weight distributions of two classes of cyclic codes: one related to the triple-error correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasami case, respectively. We then obtain infinite families of $2$-designs from these codes by proving that they are both affine-invariant codes, and explicitly determine their parameters. In particular, the codes derived from the dual of binary BCH codes hold five $3$-designs when $m = 4$.

Citation: Xiaoni Du, Rong Wang, Chunming Tang, Qi Wang. Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. Advances in Mathematics of Communications, doi: 10.3934/amc.2020106
References:
 [1] E. F. Assmus, Jr. and J. D. Key, Designs and Their Codes, volume 103 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 1992.  doi: 10.1017/CBO9781316529836.  Google Scholar [2] E. F. Assmus, Jr. and H. F. Mattson, Jr, New $5$-designs, J. Combinatorial Theory, 6 (1969), 122-151.  doi: 10.1016/S0021-9800(69)80115-8.  Google Scholar [3] T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1986.   Google Scholar [4] C. J. Colbourn and R. Mathon, Steiner systems, In Handbook of Combinatorial Designs, Second Edition, pages 128–135, Chapman and Hall/CRC, 2006. https://www.researchgate.net/publication/329786723. Google Scholar [5] C. Ding, Codes from Difference Sets, World Scientific, 2015.  Google Scholar [6] C. Ding, Designs from Linear Codes, World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2019. doi: 10.1142/11101.  Google Scholar [7] C. Ding, Infinite families of $3$-designs from a type of five-weight code, Des. Codes Cryptogr., 86 (2018), 703-719.  doi: 10.1007/s10623-017-0352-6.  Google Scholar [8] C. Ding and C. Li, Infinite families of $2$-designs and $3$-designs from linear codes, Discrete Math., 340 (2017), 2415-2431.  doi: 10.1016/j.disc.2017.05.013.  Google Scholar [9] W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.  doi: 10.1017/CBO9780511807077.  Google Scholar [10] T. Kasami, S. Lin and W. W. Peterson, Some results on cyclic codes which are invariant under the affine group and their applications, Information and Control, 11 1967,475–496. doi: 10.1016/S0019-9958(67)90691-2.  Google Scholar [11] G. T. Kennedy and V. Pless, A coding-theoretic approach to extending designs, Discrete Math., 142 (1995), 155-168.  doi: 10.1016/0012-365X(94)00010-G.  Google Scholar [12] J.-L. Kim and V. Pless, Designs in additive codes over $GF(4)$, Des. Codes Cryptogr., 30 (2003), 187-199.  doi: 10.1023/A:1025484821641.  Google Scholar [13] R. Lidl and H. Niederreiter, Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications, Addison-Wesley Publishing Company, Advanced Book Program, Reading, MA, 1983.  Google Scholar [14] J. Luo, Y. Tang and H. Wang, Cyclic codes and sequences: The generalized Kasami case, IEEE Trans. Inform. Theory, 56 (2010), 2130-2142.  doi: 10.1109/TIT.2010.2043783.  Google Scholar [15] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, I, North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977. Google Scholar [16] C. Reid and A. Rosa, Steiner systems ${S} (2, 4, v)$-a survey, The Electronic Journal of Combinatorics, DS18 (2010), 1–34. https://www.researchgate.net/publication/266996333. doi: 10.37236/39.  Google Scholar [17] V. D. Tonchev, Codes and designs, In V. Pless and W. C. Huffman, editors, Handbook of Coding Theory, Vol. I, II, pages 1229–1267. North-Holland, Amsterdam, 1998. https://www.researchgate.net/publication/268549395. Google Scholar [18] V. D. Tonchev, Codes, In C. J. Colbourn and J. H. Dinitz, editors, Handbook of Combinatorial Designs, Discrete Mathematics and its Applications (Boca Raton), pages xxii+984. Chapman & Hall/CRC, Boca Raton, FL, second edition, 2007.  Google Scholar

show all references

References:
 [1] E. F. Assmus, Jr. and J. D. Key, Designs and Their Codes, volume 103 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 1992.  doi: 10.1017/CBO9781316529836.  Google Scholar [2] E. F. Assmus, Jr. and H. F. Mattson, Jr, New $5$-designs, J. Combinatorial Theory, 6 (1969), 122-151.  doi: 10.1016/S0021-9800(69)80115-8.  Google Scholar [3] T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1986.   Google Scholar [4] C. J. Colbourn and R. Mathon, Steiner systems, In Handbook of Combinatorial Designs, Second Edition, pages 128–135, Chapman and Hall/CRC, 2006. https://www.researchgate.net/publication/329786723. Google Scholar [5] C. Ding, Codes from Difference Sets, World Scientific, 2015.  Google Scholar [6] C. Ding, Designs from Linear Codes, World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2019. doi: 10.1142/11101.  Google Scholar [7] C. Ding, Infinite families of $3$-designs from a type of five-weight code, Des. Codes Cryptogr., 86 (2018), 703-719.  doi: 10.1007/s10623-017-0352-6.  Google Scholar [8] C. Ding and C. Li, Infinite families of $2$-designs and $3$-designs from linear codes, Discrete Math., 340 (2017), 2415-2431.  doi: 10.1016/j.disc.2017.05.013.  Google Scholar [9] W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.  doi: 10.1017/CBO9780511807077.  Google Scholar [10] T. Kasami, S. Lin and W. W. Peterson, Some results on cyclic codes which are invariant under the affine group and their applications, Information and Control, 11 1967,475–496. doi: 10.1016/S0019-9958(67)90691-2.  Google Scholar [11] G. T. Kennedy and V. Pless, A coding-theoretic approach to extending designs, Discrete Math., 142 (1995), 155-168.  doi: 10.1016/0012-365X(94)00010-G.  Google Scholar [12] J.-L. Kim and V. Pless, Designs in additive codes over $GF(4)$, Des. Codes Cryptogr., 30 (2003), 187-199.  doi: 10.1023/A:1025484821641.  Google Scholar [13] R. Lidl and H. Niederreiter, Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications, Addison-Wesley Publishing Company, Advanced Book Program, Reading, MA, 1983.  Google Scholar [14] J. Luo, Y. Tang and H. Wang, Cyclic codes and sequences: The generalized Kasami case, IEEE Trans. Inform. Theory, 56 (2010), 2130-2142.  doi: 10.1109/TIT.2010.2043783.  Google Scholar [15] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, I, North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977. Google Scholar [16] C. Reid and A. Rosa, Steiner systems ${S} (2, 4, v)$-a survey, The Electronic Journal of Combinatorics, DS18 (2010), 1–34. https://www.researchgate.net/publication/266996333. doi: 10.37236/39.  Google Scholar [17] V. D. Tonchev, Codes and designs, In V. Pless and W. C. Huffman, editors, Handbook of Coding Theory, Vol. I, II, pages 1229–1267. North-Holland, Amsterdam, 1998. https://www.researchgate.net/publication/268549395. Google Scholar [18] V. D. Tonchev, Codes, In C. J. Colbourn and J. H. Dinitz, editors, Handbook of Combinatorial Designs, Discrete Mathematics and its Applications (Boca Raton), pages xxii+984. Chapman & Hall/CRC, Boca Raton, FL, second edition, 2007.  Google Scholar
The weight distribution of ${\overline{{\mathcal{C}_1}^{\bot}}}^{\bot}$
 Weight Multiplicity $0$ $1$ $2^{2s-1}$ $29\times2^{6s-5}-33\times2^{4s-5}+17\times2^{2s-3}-2$ $2^{2s-1}-2^{s-1}$ $\frac{2}{15}\times2^{2s}(3\times2^{4s}+5\times2^{2s}-8)$ $2^{2s-1}+2^{s-1}$ $\frac{2}{15}\times2^{2s}(3\times2^{4s}+5\times2^{2s}-8)$ $2^{2s-1}-2^s$ $\frac{7}{3}\times2^{4s-4}(2^{2s}-1)$ $2^{2s-1}+2^s$ $\frac{7}{3}\times2^{4s-4}(2^{2s}-1)$ $2^{2s-1}-2^{s+1}$ $\frac{1}{15}\times2^{2s-4}(2^{4s-2}-5\times2^{2s-2}+1)$ $2^{2s-1}+2^{s+1}$ $\frac{1}{15}\times2^{2s-4}(2^{4s-2}-5\times2^{2s-2}+1)$ $2^{2s}$ $1$
 Weight Multiplicity $0$ $1$ $2^{2s-1}$ $29\times2^{6s-5}-33\times2^{4s-5}+17\times2^{2s-3}-2$ $2^{2s-1}-2^{s-1}$ $\frac{2}{15}\times2^{2s}(3\times2^{4s}+5\times2^{2s}-8)$ $2^{2s-1}+2^{s-1}$ $\frac{2}{15}\times2^{2s}(3\times2^{4s}+5\times2^{2s}-8)$ $2^{2s-1}-2^s$ $\frac{7}{3}\times2^{4s-4}(2^{2s}-1)$ $2^{2s-1}+2^s$ $\frac{7}{3}\times2^{4s-4}(2^{2s}-1)$ $2^{2s-1}-2^{s+1}$ $\frac{1}{15}\times2^{2s-4}(2^{4s-2}-5\times2^{2s-2}+1)$ $2^{2s-1}+2^{s+1}$ $\frac{1}{15}\times2^{2s-4}(2^{4s-2}-5\times2^{2s-2}+1)$ $2^{2s}$ $1$
The weight distribution of ${\overline{{\mathcal{C}_2}^{\bot}}}^{\bot}$ when $d' = d$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{2s}(2^s-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}+2^{s-1}$ $2^{2s}(2^s-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}-2^{s+d-1}$ $2^{2(s-d)}(2^{s+d}-1)(2^{2s}-1)/(2^{2d}-1)$ $2^{2s-1}+2^{s+d-1}$ $2^{2(s-d)}(2^{s+d}-1)(2^{2s}-1)/(2^{2d}-1)$ $2^{2s-1}$ $2(2^{3s-d}-2^{2(s-d)}+1)(2^{2s}-1)$ $2^{2s}$ $1$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{2s}(2^s-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}+2^{s-1}$ $2^{2s}(2^s-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}-2^{s+d-1}$ $2^{2(s-d)}(2^{s+d}-1)(2^{2s}-1)/(2^{2d}-1)$ $2^{2s-1}+2^{s+d-1}$ $2^{2(s-d)}(2^{s+d}-1)(2^{2s}-1)/(2^{2d}-1)$ $2^{2s-1}$ $2(2^{3s-d}-2^{2(s-d)}+1)(2^{2s}-1)$ $2^{2s}$ $1$
The weight distribution of ${\overline{{\mathcal{C}_2}^{\bot}}}^{\bot}$ when $d' = 2d$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{2s+3d}(2^s-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)/(2^{2d}-1)(2^d+1)$ $2^{2s-1}+2^{s-1}$ $2^{2s+3d}(2^s-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)/(2^{2d}-1)(2^d+1)$ $2^{2s-1}-2^{s+d-1}$ $2^{2s-d}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)/(2^d+1)^2$ $2^{2s-1}+2^{s+d-1}$ $2^{2s-d}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)/(2^d+1)^2$ $2^{2s-1}$ $2(2^{2s}-1)(2^{3s-d}-2^{3s-2d}+2^{3s-3d}-2^{3s-4d}+2^{3s-5d}+2^{2s-d}-2^{2s-2d+1} +2^{2s-3d}-2^{2s-4d}+1)$ $2^{2s-1}-2^{s+2d-1}$ $2^{2s-4d}(2^{s-d}-1)(2^{2s}-1)/(2^d+1)(2^{2d}-1)$ $2^{2s-1}+2^{s+2d-1}$ $2^{2s-4d}(2^{s-d}-1)(2^{2s}-1)/(2^d+1)(2^{2d}-1)$ $2^{2s}$ $1$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{2s+3d}(2^s-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)/(2^{2d}-1)(2^d+1)$ $2^{2s-1}+2^{s-1}$ $2^{2s+3d}(2^s-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)/(2^{2d}-1)(2^d+1)$ $2^{2s-1}-2^{s+d-1}$ $2^{2s-d}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)/(2^d+1)^2$ $2^{2s-1}+2^{s+d-1}$ $2^{2s-d}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)/(2^d+1)^2$ $2^{2s-1}$ $2(2^{2s}-1)(2^{3s-d}-2^{3s-2d}+2^{3s-3d}-2^{3s-4d}+2^{3s-5d}+2^{2s-d}-2^{2s-2d+1} +2^{2s-3d}-2^{2s-4d}+1)$ $2^{2s-1}-2^{s+2d-1}$ $2^{2s-4d}(2^{s-d}-1)(2^{2s}-1)/(2^d+1)(2^{2d}-1)$ $2^{2s-1}+2^{s+2d-1}$ $2^{2s-4d}(2^{s-d}-1)(2^{2s}-1)/(2^d+1)(2^{2d}-1)$ $2^{2s}$ $1$
The weight distribution of ${\mathcal{C}_2}$ when $d' = d$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{s-1}(2^{2s}-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}+2^{s-1}$ $2^{s-1}(2^s-1)^2(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}-2^{s+d-1}$ $2^{s-d-1}(2^{s+d}-1)(2^{2s}-1)(2^{s-d}+1)/(2^{2d}-1)$ $2^{2s-1}+2^{s+d-1}$ $2^{s-d-1}(2^{s+d}-1)(2^{2s}-1)(2^{s-d}-1)/(2^{2d}-1)$ $2^{2s-1}$ $(2^{3s-d}-2^{2(s-d)}+1)(2^{2s}-1)$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $2^{s-1}(2^{2s}-1)(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}+2^{s-1}$ $2^{s-1}(2^s-1)^2(2^{2(s+d)}-2^{2s+d}-2^{2s}+2^{s+2d}-2^{s+d}+2^{2d})/(2^{2d}-1)$ $2^{2s-1}-2^{s+d-1}$ $2^{s-d-1}(2^{s+d}-1)(2^{2s}-1)(2^{s-d}+1)/(2^{2d}-1)$ $2^{2s-1}+2^{s+d-1}$ $2^{s-d-1}(2^{s+d}-1)(2^{2s}-1)(2^{s-d}-1)/(2^{2d}-1)$ $2^{2s-1}$ $(2^{3s-d}-2^{2(s-d)}+1)(2^{2s}-1)$
The weight distribution of ${\mathcal{C}_2}$ when $d' = 2d$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $\frac{2^{s+3d-1}(2^{2s}-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)}{(2^{2d}-1)(2^d+1)}$ $2^{2s-1}+2^{s-1}$ $\frac{2^{2s+3d-1}(2^s-1)^2(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)}{(2^{2d}-1)(2^d+1)}$ $2^{2s-1}-2^{s+d-1}$ $2^{s-1}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)(2^{s-d}+1)/(2^d+1)^2$ $2^{2s-1}+2^{s+d-1}$ $2^{s-1}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)(2^{s-d}-1)/(2^d+1)^2$ $2^{2s-1}$ $(2^{2s}-1)(2^{3s-d}-2^{3s-2d}+2^{3s-3d}-2^{3s-4d}+2^{3s-5d} +2^{2s-d}-2^{2s-2d+1}+2^{2s-3d}-2^{2s-4d}+1)$ $2^{2s-1}-2^{s+2d-1}$ $2^{s-2d-1}(2^{s-d}-1)(2^{2s}-1)(2^{s-2d}+1)/(2^d+1)(2^{2d}-1)$ $2^{2s-1}+2^{s+2d-1}$ $2^{s-2d-1}(2^{s-d}-1)(2^{2s}-1)(2^{s-2d}-1)/(2^d+1)(2^{2d}-1)$
 Weight Multiplicity $0$ $1$ $2^{2s-1}-2^{s-1}$ $\frac{2^{s+3d-1}(2^{2s}-1)(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)}{(2^{2d}-1)(2^d+1)}$ $2^{2s-1}+2^{s-1}$ $\frac{2^{2s+3d-1}(2^s-1)^2(2^{2s}-2^{2(s-d)}-2^{2s-3d}+2^s-2^{s-d}+1)}{(2^{2d}-1)(2^d+1)}$ $2^{2s-1}-2^{s+d-1}$ $2^{s-1}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)(2^{s-d}+1)/(2^d+1)^2$ $2^{2s-1}+2^{s+d-1}$ $2^{s-1}(2^{2s}-1)(2^s+2^{s-d}+2^{s-2d}+1)(2^{s-d}-1)/(2^d+1)^2$ $2^{2s-1}$ $(2^{2s}-1)(2^{3s-d}-2^{3s-2d}+2^{3s-3d}-2^{3s-4d}+2^{3s-5d} +2^{2s-d}-2^{2s-2d+1}+2^{2s-3d}-2^{2s-4d}+1)$ $2^{2s-1}-2^{s+2d-1}$ $2^{s-2d-1}(2^{s-d}-1)(2^{2s}-1)(2^{s-2d}+1)/(2^d+1)(2^{2d}-1)$ $2^{2s-1}+2^{s+2d-1}$ $2^{s-2d-1}(2^{s-d}-1)(2^{2s}-1)(2^{s-2d}-1)/(2^d+1)(2^{2d}-1)$
 [1] Arunima Bhattacharya, Micah Warren. $C^{2, \alpha}$ estimates for solutions to almost Linear elliptic equations. Communications on Pure & Applied Analysis, , () : -. doi: 10.3934/cpaa.2021024 [2] Jong Yoon Hyun, Yoonjin Lee, Yansheng Wu. Connection of $p$-ary $t$-weight linear codes to Ramanujan Cayley graphs with $t+1$ eigenvalues. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2020133 [3] Misha Bialy, Andrey E. Mironov. Rich quasi-linear system for integrable geodesic flows on 2-torus. Discrete & Continuous Dynamical Systems - A, 2011, 29 (1) : 81-90. doi: 10.3934/dcds.2011.29.81 [4] Y. Latushkin, B. Layton. The optimal gap condition for invariant manifolds. Discrete & Continuous Dynamical Systems - A, 1999, 5 (2) : 233-268. doi: 10.3934/dcds.1999.5.233 [5] Gelasio Salaza, Edgardo Ugalde, Jesús Urías. Master--slave synchronization of affine cellular automaton pairs. Discrete & Continuous Dynamical Systems - A, 2005, 13 (2) : 491-502. doi: 10.3934/dcds.2005.13.491 [6] Sabyasachi Dey, Tapabrata Roy, Santanu Sarkar. Revisiting design principles of Salsa and ChaCha. Advances in Mathematics of Communications, 2019, 13 (4) : 689-704. doi: 10.3934/amc.2019041 [7] Jérôme Ducoat, Frédérique Oggier. On skew polynomial codes and lattices from quotients of cyclic division algebras. Advances in Mathematics of Communications, 2016, 10 (1) : 79-94. doi: 10.3934/amc.2016.10.79 [8] Andrey Kovtanyuk, Alexander Chebotarev, Nikolai Botkin, Varvara Turova, Irina Sidorenko, Renée Lampe. Modeling the pressure distribution in a spatially averaged cerebral capillary network. Mathematical Control & Related Fields, 2021  doi: 10.3934/mcrf.2021016 [9] Christopher Bose, Rua Murray. Minimum 'energy' approximations of invariant measures for nonsingular transformations. Discrete & Continuous Dynamical Systems - A, 2006, 14 (3) : 597-615. doi: 10.3934/dcds.2006.14.597 [10] Ziteng Wang, Shu-Cherng Fang, Wenxun Xing. On constraint qualifications: Motivation, design and inter-relations. Journal of Industrial & Management Optimization, 2013, 9 (4) : 983-1001. doi: 10.3934/jimo.2013.9.983 [11] Hakan Özadam, Ferruh Özbudak. A note on negacyclic and cyclic codes of length $p^s$ over a finite field of characteristic $p$. Advances in Mathematics of Communications, 2009, 3 (3) : 265-271. doi: 10.3934/amc.2009.3.265 [12] Ritu Agarwal, Kritika, Sunil Dutt Purohit, Devendra Kumar. Mathematical modelling of cytosolic calcium concentration distribution using non-local fractional operator. Discrete & Continuous Dynamical Systems - S, 2021  doi: 10.3934/dcdss.2021017 [13] Marian Gidea, Rafael de la Llave, Tere M. Seara. A general mechanism of instability in Hamiltonian systems: Skipping along a normally hyperbolic invariant manifold. Discrete & Continuous Dynamical Systems - A, 2020, 40 (12) : 6795-6813. doi: 10.3934/dcds.2020166 [14] Manfred Einsiedler, Elon Lindenstrauss. On measures invariant under diagonalizable actions: the Rank-One case and the general Low-Entropy method. Journal of Modern Dynamics, 2008, 2 (1) : 83-128. doi: 10.3934/jmd.2008.2.83 [15] Diana Keller. Optimal control of a linear stochastic Schrödinger equation. Conference Publications, 2013, 2013 (special) : 437-446. doi: 10.3934/proc.2013.2013.437 [16] Guillaume Bal, Wenjia Jing. Homogenization and corrector theory for linear transport in random media. Discrete & Continuous Dynamical Systems - A, 2010, 28 (4) : 1311-1343. doi: 10.3934/dcds.2010.28.1311 [17] Nizami A. Gasilov. Solving a system of linear differential equations with interval coefficients. Discrete & Continuous Dynamical Systems - B, 2021, 26 (5) : 2739-2747. doi: 10.3934/dcdsb.2020203 [18] Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour. Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 321-332. doi: 10.3934/naco.2020028 [19] Reza Lotfi, Yahia Zare Mehrjerdi, Mir Saman Pishvaee, Ahmad Sadeghieh, Gerhard-Wilhelm Weber. A robust optimization model for sustainable and resilient closed-loop supply chain network design considering conditional value at risk. Numerical Algebra, Control & Optimization, 2021, 11 (2) : 221-253. doi: 10.3934/naco.2020023 [20] Rabiaa Ouahabi, Nasr-Eddine Hamri. Design of new scheme adaptive generalized hybrid projective synchronization for two different chaotic systems with uncertain parameters. Discrete & Continuous Dynamical Systems - B, 2021, 26 (5) : 2361-2370. doi: 10.3934/dcdsb.2020182

2019 Impact Factor: 0.734