Metric complements to subspaces in the Boolean cube



We study the metric complements to subsets in the Boolean cube, i.e. the subsets maximally distant from a given subset. We obtain the general form for the metric complement of a linear subspace and some more exact description for the class of subspaces with basis of a special form. It is proved that the completely regular codes (including perfect and uniformly packed) are metrically regular.


subspace metrically regular set metric complement completely regular code bent-function 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977; Svyaz’, Moscow, 1979).MATHGoogle Scholar
  2. 2.
    C. Carlet, “Lower Bounds on the Higher Order Nonlinearities of Boolean Functions and Their Applications to the Inverse Function,” in Proceedings of 2008 IEEE Information Theory Workshop, (Porto, Portugal, May 5–9, 2008) (IEEE, Piscataway, 2008), pp. 333–337.CrossRefGoogle Scholar
  3. 3.
    S. Kavut, S. Maitra, and M. D. Yucel, “Search for Boolean Functions with Excellent Profiles in the Rotation Symmetric Class,” IEEE Trans. Inform. Theory 53 (5), 1743–1751 (2007).MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    S. Maitra and P. Sarkar, “Maximum Nonlinearity of Symmetric Boolean Functions on Odd Number of Variables,” IEEE Trans. Inform. Theory 48 (9), 2626–2630 (2002).MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    A. Neumaier, “Completely Regular Codes,” DiscreteMath. 106, 353–360 (1992).MathSciNetMATHGoogle Scholar
  6. 6.
    O. S. Rothaus, “On ‘bent’ functions,” J. Combin. Theory Ser. A 20 (3), 300–305 (1976).MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    G. Sun and C. Wu, “The Lower Bound on the Second-Order Nonlinearity of a Class of Boolean Functions with High Nonlinearity,” Appl. Algebra Engrg. Commun. Comput. 22 (1), 37–45 (2011).MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    N. N. Tokareva, “Duality Between Bent Functions and Affine Functions,” Discrete Math. 312 (3), 666–670 (2012).MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    N. N. Tokareva, Bent Functions: Results and Applications to Cryptography (Academic Press, San Diego, 2015).CrossRefMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2016

Authors and Affiliations

  1. 1.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations