Skip to main content

Determination of Dual Distances for a Kind of Perfect Mixed Codes

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11343))

Included in the following conference series:

  • 408 Accesses

Abstract

A series of mixed perfect codes with minimal distances \(d=3\) has been constructed in term of the partitions of vector space over finite field \(\mathbb {F}_{p}\) by B.Lindström. In this paper the minimal distance of the dual codes of a certain class of such perfect codes has been determined. As an application of this result we constructed a series of good orthogonal arrays with mixed levels and good inhomogeneous asymmetric quantum codes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Feng, K., Xu, L., Hickernell, F.: Linear error-block codes. Finite Fields Their Appl. 12, 638–652 (2006)

    Article  MathSciNet  Google Scholar 

  2. Hedayet, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays: Theory and Applications. Springer Series in Statistics. Springer, New York (1999). https://doi.org/10.1007/978-1-4612-1478-6

    Book  Google Scholar 

  3. Heden, O.: Partitions of finite Abelian groups. Eur. J. Comb. 7, 11–25 (1986)

    Article  MathSciNet  Google Scholar 

  4. Herzog, M., Schönheim, J.: Linear and nonlinear single error-correcting perfect mixed codes. Inf. Control. 18, 364–368 (1971)

    Article  MathSciNet  Google Scholar 

  5. Lindström, B.: Group partitions and mixed perfect codes. Can. Math. Bull. 18, 57–60 (1975)

    Article  MathSciNet  Google Scholar 

  6. El-Zanati, S.I., Seelinger, G.F., Sissokho, P.A., Spence, L.E., Vanden Eynden, C.: Partitions of finite vector spaces into subspaces. J. Comb. Des. 16, 329–341 (2008)

    Article  MathSciNet  Google Scholar 

  7. Wang, L., Feng, K., Ling, S., Xing, C.: Asymmetric quantum codes: characterization and constructions. IEEE Trans. Inf. Theory 56(6), 2938–2945 (2010)

    Article  MathSciNet  Google Scholar 

  8. Wang, W., Feng, R., Feng, K.: Inhomogenous quantum codes (I): additive case. Sci. China: Math. 53, 2501–2510 (2010)

    Article  MathSciNet  Google Scholar 

  9. Wang, W., Feng, K.: Inhomogenous quantum codes (III): asymmetric case (2010, preprint)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tianyi Mao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mao, T. (2018). Determination of Dual Distances for a Kind of Perfect Mixed Codes. In: Tang, S., Du, DZ., Woodruff, D., Butenko, S. (eds) Algorithmic Aspects in Information and Management. AAIM 2018. Lecture Notes in Computer Science(), vol 11343. Springer, Cham. https://doi.org/10.1007/978-3-030-04618-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04618-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04617-0

  • Online ISBN: 978-3-030-04618-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics