Skip to main content

The Dual of Convolutional Codes Over \({\mathbb {Z}}_{p^r}\)

  • Conference paper
  • First Online:
Applied and Computational Matrix Analysis (MAT-TRIAD 2015)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 192))

Included in the following conference series:

Abstract

An important class of codes widely used in applications is the class of convolutional codes . Most of the literature of convolutional codes is devoted to convolutional codes over finite fields. The extension of the concept of convolutional codes from finite fields to finite rings have attracted much attention in recent years due to fact that they are the most appropriate codes for phase modulation. However convolutional codes over finite rings are more involved and not fully understood. Many results and features that are well-known for convolutional codes over finite fields have not been fully investigated in the context of finite rings. In this paper we focus in one of these unexplored areas, namely, we investigate the dual codes of convolutional codes over finite rings. In particular we study the p-dimension of the dual code of a convolutional code over a finite ring. This contribution can be considered a generalization and an extension, to the ring case, of the work done by Forney and McEliece on the dimension of the dual code of a convolutional code over a finite field.

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 EPUB and 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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Calderbank, A.R., Sloane, N.J.A.: Modular and \(p\)-adic cyclic codes. Des. Codes Cryptogr. 6(1), 21–35 (1995)

    Google Scholar 

  2. Conway, J.H., Sloane, N.J.A.: Self-dual codes over the integers modulo 4. J. Comb. Theory A 62, 30–45 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Forney Jr., G.D.: Convolutional codes I: algebraic structure. IEEE Trans. Inf. Theory IT–16(5), 720–738 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  4. Forney Jr., G.D.: Structural analysis of convolutional codes via dual codes. Trans. Inf. Theory IT–19(5), 512–518 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jacobson, N.: Basic Algebra II. W. H. Freeman, San Francisco (1989)

    MATH  Google Scholar 

  6. Kuijper, M., Pinto, R.: On minimality of convolutional ring encoders. IEEE Trans. Autom. Control 55(11), 4890–4897 (2009)

    MathSciNet  Google Scholar 

  7. Kuijper, M., Pinto, R., Polderman, J.W.: The predictable degree property and row reducedness for systems over a finite ring. Linear Algebr. Appl. 425(2–3), 776–796 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Massey, J. L., Mittelholzer, T.: Convolutional codes over rings. In: Proceedings of the 4th Joint Swedish-Soviet International Workshop Information Theory, pp. 14–18 (1989)

    Google Scholar 

  9. McEliece, R.J.: The algebraic theory of convolutional codes. Handbook of Coding Theory, vol. 1, pp. 1065–1138. Elsevier Science Publishers, Amsterdam (1998)

    Google Scholar 

  10. Napp, D., Pinto, R., Toste, M.: On MDS convolutional codes over \({\mathbb{Z}}_{{p}^{r}}\). http://arxiv.org/abs/1601.04507. (Submitted on 18 Jan 2016)

  11. Norton, G., Salagean, A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebr. Eng. Commun. Comput. 10(6), 489–506 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Norton, G.H., Salagean, A.: On the hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46(3), 1060–1067 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Oued, M.El: On MDR codes over a finite ring. IJICoT 3(2), 107–119 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Oued, M.El, Solé, P.: MDS convolutional codes over a finite ring. IEEE Trans. Inf. Theory 59(11), 7305–7313 (2013)

    Article  MathSciNet  Google Scholar 

  15. Vazirani, V.V., Saran, H., Rajan, B.S.: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory 42, 1839–1854 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wood, J.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121(3), 555–575 (1999)

    Google Scholar 

Download references

Acknowledgements

The work of the second, third and fourth authors was supported in part by the Portuguese Foundation for Science and Technology (FCT-Fundação para a Ciência e a Tecnologia), through CIDMA - Center for Research and Development in Mathematics and Applications, within project UID/MAT/04106/2013.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Diego Napp .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

El Oued, M., Napp, D., Pinto, R., Toste, M. (2017). The Dual of Convolutional Codes Over \({\mathbb {Z}}_{p^r}\) . In: Bebiano, N. (eds) Applied and Computational Matrix Analysis. MAT-TRIAD 2015. Springer Proceedings in Mathematics & Statistics, vol 192. Springer, Cham. https://doi.org/10.1007/978-3-319-49984-0_5

Download citation

Publish with us

Policies and ethics