Abstract
We enumerate all \(q\)-ary additive (in particular, linear) block codes of length \(n\) and cardinality \(N\ge q^2\) with exactly two distances: \(d\) and \(n\). For arbitrary codes of length \(n\) with distances \(d\) and \(n\), we obtain upper bounds on the cardinality via linear programming and using relationships to 2-distance sets on a Euclidean sphere.
Similar content being viewed by others
References
Calderbank R. Kantor, W.M., The Geometry of Two-Weight Codes, Bull. London Math. Soc., 1986, vol. 18, no. 2, pp. 97–122. https://doi.org/10.1112/blms/18.2.97
Shi, M., Guan, Y., and Solé, P., Two New Families of Two-Weight Codes, IEEE Trans. Inform. Theory, 2017, vol. 63, no. 10, pp. 6240–6246. https://doi.org/10.1109/TIT.2017.2742499
Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., Codes with Two Distances: \(d\) and \(d+1\), in Proc. 16th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XVI), Svetlogorsk, Kaliningrad region, Russia, Sept. 2–8, 2018, pp. 40–45. Available at https://www.dropbox.com/s/h7u89lh8vyirww9/Proceedings\%20final.pdf?dl=0.
Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev V.A., On \(q\)-ary Codes with Two Distances \(d\) and \(d+1\), Probl. Peredachi Inf., 2020, vol. 56, no. 1, pp. 38–50 [Probl. Inf. Transm.] (Engl. Transl.), 2020, vol. 56, no. 1, pp. 33–44]. https://doi.org/10.1134/S0032946020010044
Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., Two-Weight (Linear and Nonlinear) Codes, in Proc. 17th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT’2020), on-line, Bulgaria, Oct. 11–17, 2020, pp. 11–17. https://doi.org/10.1109/ACCT51235.2020.9383353
Boyvalenkov, P., Delchev, K., Zinoviev, D.V., and Zinoviev, V.A., On Two-Weight Codes, Discrete Math., 2021, vol. 344, no. 5, Paper No. 112318 (15 pp.). https://doi.org/10.1016/j.disc.2021.112318
Delsarte, P., Two-Weight Linear Codes and Strongly Regular Graphs, MBLE Res. Lab. Report, Brussels, Belgium, 1971, no. R160.
Delsarte, P., Weights of Linear Codes and Strongly Regular Normed Spaces, Discrete Math., 1972, vol. 3, no. 1–3, pp. 47–64. https://doi.org/10.1016/0012-365X(72)90024-6
Landjev, I., Rousseva, A., and Storme, L., On Linear Codes of Almost Constant Weight and the Related Arcs, C. R. Acad. Bulgare Sci., 2019, vol. 72, no. 12, pp. 1626–1633. https://doi.org/10.7546/CRABS.2019.12.04
Borges, J., Rifà, J., and Zinoviev, V.A., On \(q\)-ary Linear Completely Regular Codes with \(\rho=2\) and Antipodal Dual, Adv. Math. Commun., 2010, vol. 4, no. 4, pp. 567–578. https://doi.org/10.3934/amc.2010.4.567
Bose, R.C. and Bush, K.A., Orthogonal Arrays of Strength Two and Three, Ann. Math. Statist., 1952, vol. 23, no. 4, pp. 508–524. https://doi.org/10.1214/aoms/1177729331
Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., A Class of Maximum Equidistant Codes, Probl. Peredachi Inf., 1969, vol. 5, no. 2, pp. 84–87 [Probl. Inf. Transm. (Engl. Transl.), 1969, vol. 5, no. 2, pp. 65–68]. http://mi.mathnet.ru/eng/ppi1804
Bassalygo, L.A., Dodunekov, S.M., Zinoviev, V.A., and Helleseth, T., The Grey–Rankin Bound for Nonbinary Codes, Probl. Peredachi Inf., 2006, vol. 42, no. 3, pp. 37–44 [Probl. Inf. Transm. (Engl. Transl.), 2006, vol. 42, no. 3, pp. 197–203]. https://doi.org/10.1134/S0032946006030033
Helleseth, T., Kløve, T., and Levenshtein, V.I., A Bound for Codes with Given Minimum and Maximum Distances, in Proc. 2006 IEEE Int. Symp. on Information Theory (ISIT’2006), Seattle, WA, USA, July 9–14, 2006, pp. 292–296. https://doi.org/10.1109/ISIT.2006.261600
Boyvalenkov, P.G., Dragnev, P.D., Hardin, D.P., Saff, E.B., and Stoyanova, M.M., Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances, IEEE Trans. Inform. Theory, 2021, vol. 67, no. 6, pp. 3569–3584. https://doi.org/10.1109/TIT.2021.3056319
Beth, T., Jungnickel, D., and Lenz, H., Design Theory, Cambridge, UK: Cambridge Univ. Press, 1986.
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.
Denniston, R.H.F., Some Maximal Arcs in Finite Projective Planes, J. Combin. Theory, 1969, vol. 6, no. 3, pp. 317–319. https://doi.org/10.1016/S0021-9800(69)80095-5
Thas, J.A., Construction of Maximal Arcs and Partial Geometry, Geom. Dedicata, 1974, vol. 3, no. 1, pp. 61–64. https://doi.org/10.1007/BF00181361
Thas, J.A., Projective Geometry over a Finite Field, Ch. 7 of Handbook of Incidence Geometry: Buildings and Foundations, Buekenhout, F., Ed., Amsterdam: Elsevier, 1995, pp. 295–347. https://doi.org/10.1016/B978-044488355-1/50009-8
Semakov, N.V. and Zinoviev, V.A., Equidistant \(q\)-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs, Probl. Peredachi Inf., 1968, vol. 4, no. 2, pp. 3–10 [Probl. Inf. Transm. (Engl. Transl.), 1968, vol. 4, no. 2, pp. 1–7]. http://mi.mathnet.ru/eng/ppi1845
Bush, K.A., Orthogonal Arrays of Index Unity, Ann. Math. Statist., 1952, vol. 23, no. 3, pp. 426–434. https://doi.org/10.1214/aoms/1177729387
Ball, S., Blokhuis, A., and Mazzocca, F., Maximal Arcs in Desarguesian Planes of Odd Order Do Not Exist, Combinatorica, 1997, vol. 17, no. 1, pp. 31–41. https://doi.org/10.1007/BF01196129
Landjev, I., Rousseva, A., and Vorobev, K., Constructions of Binary Codes with Two Distances, Preprint, 2022.
Larman, D.G., Rogers, C.A., and Seidel, J.J., On Two-Distance Sets in Euclidean Space, Bull. London Math. Soc., 1977, vol. 9, no. 3, pp. 261–267. https://doi.org/10.1112/blms/9.3.261
Barg, A., Glazyrin, A., Kao, W.-J., Lai, C.-Y., Tseng, P.-C., and Yu, W.-H., On the Size of Maximal Binary Codes with 2, 3, and 4 Distances, https://arXiv.org/abs/2210.07496 [math.CO], 2022.
Glazyrin, A. and Yu, W.-H., Upper Bounds for \(s\)-Distance Sets and Equiangular Lines, Adv. Math., 2018, vol. 330, pp. 810–833. https://doi.org/10.1016/j.aim.2018.03.024
Funding
The research of P. Boyvalenkov was supported in part by the Bulgarian National Science Foundation, project no. KP-06-Russia/33-2020.
The research of K. Delchev was supported in part by the Bulgarian National Science Foundation, project no. KP-06-N32/2-2019.
The research of V.A. Zinoviev and D.V. Zinoviev was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences within the program of fundamental research on the topic “Mathematical Foundations of the Theory of Error-Correcting Codes” and was also supported by the National Science Foundation of Bulgaria under project no. 20-51-18002.
Author information
Authors and Affiliations
Additional information
Translated from Problemy Peredachi Informatsii, 2022, Vol. 58, No. 4, pp. 62–83. https://doi.org/10.31857/S0555292322040064
Rights and permissions
About this article
Cite this article
Boyvalenkov, P., Delchev, K., Zinoviev, V. et al. On Codes with Distances \(d\) and \(n\). Probl Inf Transm 58, 352–371 (2022). https://doi.org/10.1134/S0032946022040068
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946022040068