Abstract
Minimum weight bases of some extended cyclic codes can be chosen from the affine orbits of certain explicitly represented minimum weight codewords. We find such bases for the following three classes of codes: the extended primitive 2-error correcting BCH code of length \(n=2^m,\) where \(m\ge 4\) (for \(m\ge 20\) the result was proven in Grigorescu and Kaufman IEEE Trans Inf Theory 58(I. 2):78–81, 2011), the extended cyclic code \(\bar{C}_{1,5}\) of length \(n=2^m,\) odd m, \(m\ge 5,\) and the extended cyclic codes \(\bar{C}_{1,2^i+1}\) of lengths \(n=2^m,\) \((i,\,m)=1\) and \(3\le i\le \frac{m-5}{4}-o(m).\)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Augot D., Charpin P., Sendrier N.: Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inf. Theory 30(3), 960–973 (1992).
Bassalygo L.A., Zaitsev G.A., Zinoviev V.A.: Uniformly packed codes. Probl. Inf. Transm. 10(I. 1), 6–9 (1974).
Carlet C., Charpin P., Zinoviev V.A.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125–156 (1998).
Charpin P.: Chapter 11. In: Pless V.S., Huffman W. (eds.), Handbook of Coding Theory, vol. 1. North Holland, Amsterdam (1998).
Gorenstein D.C., Peterson W.W., Zierler N.: Two-error correcting codes Bose–Chaudhuri codes are quasi-perfect. Inf. Control 3, 291–294 (1960).
Grigorescu E., Kaufman T.: Explicit low-weight bases for BCH codes. IEEE Trans. Inf. Theory 58(I.2), 78–81 (2011).
Kasami T., Lin S., Peterson W.W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inf. Control 11, 475–496 (1968).
Kaufman T., Litsyn S.: Almost orthogonal linear codes are locally testable. In: FOCS, pp 317–326. IEEE Computer Society (2005).
Kurlyandchik Ya.M.: On logarithmical asymptotic of maximal cyclic spread \(r>2\) length. Discret. Anal. 19, 48–55 (1971) (in Russian).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).
Mogilnykh I.Yu., Östergård P.R., Pottonen O., Solov’eva F.I.: Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inf. Theory 55, 2622–2625 (2009).
Simonis J.: On generator matrices of codes. IEEE Trans. Inf. Theory 38(I. 2), 516 (1992).
Solov’eva F.I.: Factorization of code-generating d.n.f. Methody Discret. Anal. 47, 66–88 (1988). (in Russian).
Solov’eva F.I.: Coding Theory, Textbook, p. 137. Novosibirsk State University, Novosibirsk (2015).
Spielman D.A.: Faster isomorphism testing of strongly regular graphs. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 22–24 May, pp 576–584 (1996).
van Tilborg H.C.A.: Binary uniformly packed codes. PhD Thesis, Tech. Univ. Eindhoven (1976).
Acknowledgements
This work was partially supported by the Grants RFBR 16-01-00499, 15-01-05867. We would like to express our gratitude to Daniel Augot and Pascale Charpin for their useful remarks.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. A. Zinoviev.
Rights and permissions
About this article
Cite this article
Mogilnykh, I.Y., Solov’eva, F.I. On explicit minimum weight bases for extended cyclic codes related to Gold functions. Des. Codes Cryptogr. 86, 2619–2627 (2018). https://doi.org/10.1007/s10623-018-0464-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-018-0464-7