Abstract
A weighing matrix W of order \(n=\frac{p^{m+1}-1}{p-1}\) and weight \(p^m\) is constructed and shown that the rows of W and \(-W\) together form optimal constant weight ternary codes of length n, weight \(p^m\) and minimum distance \(p^{m-1}(\frac{p+3}{2})\) for each odd prime power p and integer \(m\ge 1\) and thus
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bogdanova G., Todorov T., Yorgova T.: New ternary and quaternary constant-weight equidistant codes. Discret. Math. Algorithms Appl. 2(1), 89–97 (2010).
Cary H.W., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).
Fu F.-W., Han Vinck A.J., Shen S.-Y.: On the constructions of constant-weight codes. IEEE Trans. Inf. Theory 44(1), 328–333 (1998).
Ge G.: Construction of optimal ternary constant weight codes via Bhaskar Rao designs. Discret. Math. 308(13), 2704–2708 (2008).
Hadi K., Thomas P., Sho S.: A family of balanced generalized weighing matrices. Combinatorica (2022).
Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays Theory and Applications. Springer Series in Statistics. Springer, New York (1999).
Ionin Y.J., Shrikhande M.S.: Combinatorics of Symmetric Designs, New Mathematical Monographs, vol. 5. Cambridge University Press, Cambridge (2006).
Patric R.J.Ö., Mattias S.: Ternary constant weight codes. Electron. J. Comb. 9(1). Research Paper 41 (2002).
Robert C., Hadi K.: Orthogonal Designs in Handbook of Combinatorial Designs, pp. 273–280. Chapman & Hall/CRC, Boca Raton (2007).
Seberry J., Yamada M.: Hadamard Matrices, Sequences, and Block Designs, Contemporary Design Theory, pp. 431–560. Wiley, New York (1992).
Vladimir D.T.: Codes in Handbook of Combinatorial Designs, pp. 677–701. Chapman & Hall/CRC, Boca Raton (2007).
Zhang H., Ge G.: Optimal ternary constant-weight codes of weight four and distance six. IEEE Trans. Inf. Theory 56(5), 2188–2203 (2010).
Zhang H., Zhang X., Ge G.: Optimal ternary constant-weight codes with weight 4 and distance 5. IEEE Trans. Inf. Theory 58(5), 2706–2718 (2012).
Acknowledgements
The help and guidance from Professor Vladimir Tonchev are much appreciated. The authors acknowledge the valuable comments by the anonymous referees and for showing the reference [3]. Hadi Kharaghani is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). Sho Suda is supported by JSPS KAKENHI Grant Number 18K03395.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by G. Ge.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Kharaghani, H., Suda, S. & Zaitsev, V. On a class of optimal constant weight ternary codes. Des. Codes Cryptogr. 91, 45–54 (2023). https://doi.org/10.1007/s10623-022-01096-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01096-2