Skip to main content
SpringerLink
Log in

Nonlinear q-ary codes with large code distance

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We construct a family of nonlinear q-ary codes obtained from the corresponding families of modified complex Butson–Hadamard matrices. Parameters of the codes are quite close to the Plotkin bound and in a number of cases attain this bound. Furthermore, these codes admit rather simple encoding and decoding procedures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Butson, K.T., Generalized Hadamard Matrices, Proc. Amer. Math. Soc., 1962, vol. 13, no. 6, pp. 894–898.

    Article  MATH  MathSciNet  Google Scholar 

  2. Baliga, A. and Horadam, K.J., Cocyclic Hadamard Matrices over Zt × Z2 2, Australas. J. Comb., 1995, vol. 11, pp. 123–134.

    MATH  Google Scholar 

  3. Elliot, D.F. and Rao, K.R., Fast Transforms: Algorithms, Analyses, Applications, New York: Academic, 1982.

    Google Scholar 

  4. de Launey, W., Generalized Hadamard Matrices Whose Rows and Columns Form a Group, Combinatorial Mathematics X (Proc. Conf. Held in Adelaide, Australia, Aug. 23–27, 1982), Casse, L.R.A., Ed., Lect. Notes Math, vol. 1036. New York: Springer, 1983, pp. 154–176.

    Google Scholar 

  5. Maslen, D.K. and Rockmore, D.N., Generalized FFTs—A Survey of Some Recent Results, Groups and Computation II (Workshop on Groups and Computation, New Brunswick, NJ, USA, June 7–10, 1995), Finkelstein, L. and Kantor, W.M., Eds., Providence: AMS, 1997, pp. 183–237.

    Google Scholar 

  6. Baliga, A., New Self-dual Codes from Cocyclic Hadamard Matrices, J. Comb. Math. Comb. Comput., 1982, vol. 28, pp. 7–14.

    MATH  MathSciNet  Google Scholar 

  7. Horadam, K.J. and Udaya, P., Cocyclic Hadamard Codes, IEEE Trans. Inform. Theory, 2000, vol. 46, no. 4, pp. 1545–1550.

    Article  MATH  MathSciNet  Google Scholar 

  8. Pinnawala, N. and Rao, A., Cocyclic Simplex Codes of Type α over Z4 and Z2s, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 9, pp. 2165–2169.

    Article  MATH  MathSciNet  Google Scholar 

  9. 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.

    MATH  Google Scholar 

  10. Stepanov, S.A., A New Class of Quaternary Codes, Probl. Peredachi Inf., 2006, vol. 42, no. 1, pp. 3–12 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 1, pp. 1–9].

    MATH  MathSciNet  Google Scholar 

  11. Stepanov, S.A., A New Class of Nonlinear Q-ary Codes, Probl. Peredachi Inf., 2006, vol. 42, no. 3, pp. 45–58 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 3, pp. 204–216].

    MATH  MathSciNet  Google Scholar 

  12. Stepanov, S.A., Nonlinear Codes Constructed from Modified Butson–HadamardMatrices, Diskret. Mat., 2006, vol. 18, no. 4, pp. 137–147 [Discrete Math. Appl. (Engl. Transl.), 2006, vol. 16, no. 5, pp. 429–438].

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    S. A. Stepanov

Authors
  1. S. A. Stepanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. A. Stepanov.

Additional information

Original Russian Text © S.A. Stepanov, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 3, pp. 44–53.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stepanov, S.A. Nonlinear q-ary codes with large code distance. Probl Inf Transm 53, 242–250 (2017). https://doi.org/10.1134/S003294601703005X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S003294601703005X

Search

Navigation