Skip to main content
SpringerLink
Log in

Multicomponent codes with maximum code distance

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

Abstract

We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension. We find values of parameters for which the codes are of the maximum cardinality. We construct combined codes where the last component of the multicomponent code is the code from [1] found by exhaustive search for particular parameter values. As a result, we obtain a family of subspace codes with maximum cardinality for a number of parameters. We show that the family of maximum-cardinality codes can be extended by using dual codes.

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. El-Zanati, S., Jordon, H., Seelinger, G., Sissokho, P., and Spence, L., The Maximum Size of a Partial 3-Spread in a Finite Vector Space over GF(2), Des. Codes Cryptogr., 2010, vol. 54, no. 2, pp. 101–107.

    Article  MathSciNet  MATH  Google Scholar 

  2. Kötter, R. and Kschischang, F.R., Coding for Errors and Erasures in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 8, pp. 3579–3591.

    Article  MathSciNet  MATH  Google Scholar 

  3. Silva, D., Kschischang, F.R., and Kötter, R., A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 9, pp. 3951–3967.

    Article  MathSciNet  MATH  Google Scholar 

  4. Gabidulin, E.M. and Bossert, M., Codes for Network Coding, in Proc. 2008 IEEE Int. Sympos. on Information Theory (ISIT’2008), Toronto, Canada, July 6–11, 2008, pp. 867–870.

    Chapter  Google Scholar 

  5. Gabidulin, E.M. and Bossert, M., Algebraic Codes for Network Coding, Probl. Peredachi Inf., 2009, vol. 45, no. 4, pp. 54–68 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 4, pp. 343–356].

    MathSciNet  MATH  Google Scholar 

  6. Gabidulin, E.M. and Pilipchuk, N.I., Efficiency of Subspace Network Codes, Proc. Moscow Inst. Phys. Technol., 2015, vol. 7, no. 1, pp. 104–111.

    Google Scholar 

  7. Gabidulin, E.M., Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1–12].

    MathSciNet  MATH  Google Scholar 

  8. Wang, H., Xing, C., and Safavi-Naini, R., Linear Authentication Codes: Bounds and Constructions, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 4, pp. 866–873.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dembowski, P., Finite Geometries, Berlin: Springer-Verlag, 1968.

    Book  MATH  Google Scholar 

  10. Beutelspacher, A., Partial Spreads in Finite Projective Spaces and Partial Designs, Math. Z., 1975, vol. 145, no. 3, pp. 211–229.

    Article  MathSciNet  MATH  Google Scholar 

  11. Drake, D.A. and Freeman, J.W., Partial t-Spreads and Group Constructible (s, r, µ)-Nets, J. Geom., 1979, vol. 13, no. 2, pp. 210–216.

    Article  MathSciNet  MATH  Google Scholar 

  12. Beutelspacher, A., Blocking Sets and Partial Spreads in Finite Projective Spaces, Geom. Dedicata, 1980, vol. 9, no. 4, pp. 425–449.

    Article  MathSciNet  MATH  Google Scholar 

  13. Xia, T. and Fu, F.W., Jonson Type Bounds on Constant Dimension Codes, Des. Codes Cryptogr., 2009, vol. 50, no. 2, pp. 163–172.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology (State University), Moscow, Russia

    E. M. Gabidulin & N. I. Pilipchuk

Authors
  1. E. M. Gabidulin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. I. Pilipchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. M. Gabidulin.

Additional information

Original Russian Text © E.M. Gabidulin, N.I. Pilipchuk, 2016, published in Problemy Peredachi Informatsii, 2016, Vol. 52, No. 3, pp. 84–91.

Original Russian Text © E.M. Gabidulin, N.I. Pilipchuk, 2016, published in Problemy Peredachi Informatsii, 2016, Vol. 52, No. 3, pp. 84–91.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gabidulin, E.M., Pilipchuk, N.I. Multicomponent codes with maximum code distance. Probl Inf Transm 52, 276–283 (2016). https://doi.org/10.1134/S0032946016030054

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation