Skip to main content

Some Constructions of \(\mathcal{T}\)-Direct Codes over GF(2n)

  • Conference paper
Recent Advances in Intelligent Informatics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 235))

Abstract

The class of \(\mathcal{T}\)-Direct codes are an extension to the class of linear codes with complementary duals. In this paper, a construction procedure that constructs an n 2-Direct code from an n-Direct code is described. Further, the construction procedure is employed recursively to construct \(n^{2^{m+1}}\)-Direct codes for m ≥ 0. Finally, \(\mathcal{T}^{2}\)-Direct codes are obtained from arbitrary \(\mathcal{T}\)-Direct codes with constituent codes of variable rates. The proposed construction procedure, when employed on an existing \({\mathcal{T}}\)-Direct code, in fact increases the number of constituent codes (users), thereby supporting more users in a multi-user environment.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gabidulin, E.M.: Theory of codes with maximum rank distance. Problems in Information Transmission 21, 1–12 (1985)

    MATH  Google Scholar 

  2. Massey, J.L.: Linear codes with complementary duals. Discrete Mathematics 106-107, 337–342 (1992)

    Article  MathSciNet  Google Scholar 

  3. Urbanke, R., Rimoldi, B.: Coding for the F-Adder Channel: Two applications for Reed-Solomon codes. In: Proceedings of IEEE International Symposium on Information Theory, San Antonio, p. 85 (1993)

    Google Scholar 

  4. Rimoldi, B.: Coding for the Guassian multiple access channel: An algebraic approach. In: Proceedings of International Symposium on Information Theory, Austin, TX (1993)

    Google Scholar 

  5. Vasantha, W.B., Raja Durai, R.S.: \(\mathcal{T}\)-Direct codes: An application to \(\mathcal{T}\)-user BAC. In: Proceedings of the IEEE Information Theory Workshop, Bangalore, India, p. 214 (2002)

    Google Scholar 

  6. Vasantha, W.B., Raja Durai, R.S.: Some results on \(\mathcal{T}\)-Direct codes. In: Proceedings of the 3rd Asia-Europe Workshop on Information Theory, Kamogawa, Chiba, Japan, pp. 43–44 (2003)

    Google Scholar 

  7. Raja Durai, R.S., Devi, M.: Construction of (\(\mathcal{N}+\mathcal{M}\))-Direct codes in \(GF(2^{\mathcal{N}})\). In: Proceedings of World Congress on Information and Communication Technologies, Mumbai, India, pp. 770–775 (2011)

    Google Scholar 

  8. Raja Durai, R.S., Devi, M.: On the class of \(\mathcal{T}\)-Direct codes over GF(2N). International Journal of Computer Information Systems and Industrial Management Applications 5, 589–596 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Durai, R.S.R., Devi, M. (2014). Some Constructions of \(\mathcal{T}\)-Direct Codes over GF(2n). In: Thampi, S., Abraham, A., Pal, S., Rodriguez, J. (eds) Recent Advances in Intelligent Informatics. Advances in Intelligent Systems and Computing, vol 235. Springer, Cham. https://doi.org/10.1007/978-3-319-01778-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01778-5_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01777-8

  • Online ISBN: 978-3-319-01778-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics