Skip to main content
Top
Published in: Journal of Applied Mathematics and Computing 1-2/2018

31-05-2017 | Original Research

On LCD repeated-root cyclic codes over finite fields

Authors: Binbin Pang, Shixin Zhu, Jin Li

Published in: Journal of Applied Mathematics and Computing | Issue 1-2/2018

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, we investigate the LCD repeated-root cyclic codes of length \(n=n'p^r\) over the finite field \(\mathbb {F}_q\), where gcd\((n',p)=1\). We give a necessary and sufficient condition for a repeated-root cyclic code to be LCD over \(\mathbb {F}_q\). We also determine the minimum distance of LCD repeated-root cyclic codes over \(\mathbb {F}_q\). Finally, we give the enumeration of LCD repeated-root cyclic codes of length n over \(\mathbb {F}_q\).

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Carlet, C., Mesnager, S., Tang, C.M., Qi, Y.F.: Linear Codes Over \(\mathbb{F} _q\) which are Equivalent to LCD Codes. arXiv:1703.04346 (2017) Carlet, C., Mesnager, S., Tang, C.M., Qi, Y.F.: Linear Codes Over \(\mathbb{F} _q\) which are Equivalent to LCD Codes. arXiv:​1703.​04346 (2017)
4.
go back to reference Dinh, H.Q., López-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inf. Theory 50, 1728–1744 (2004)MathSciNetCrossRefMATH Dinh, H.Q., López-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inf. Theory 50, 1728–1744 (2004)MathSciNetCrossRefMATH
6.
go back to reference Guenda, K., Gulliver, T.A.: Self-dual repeated-root cyclic and negacyclic codes over finite fields. In: IEEE International Symposium on Information Theory Proceedings (2012) Guenda, K., Gulliver, T.A.: Self-dual repeated-root cyclic and negacyclic codes over finite fields. In: IEEE International Symposium on Information Theory Proceedings (2012)
8.
go back to reference Jin, L.F.: Construction of MDS codes with complementary duals. IEEE Trans. Inf. Theory 63, 2843–2847 (2017)MathSciNetMATH Jin, L.F.: Construction of MDS codes with complementary duals. IEEE Trans. Inf. Theory 63, 2843–2847 (2017)MathSciNetMATH
14.
17.
18.
go back to reference Zeh, A., Ulmschneider, M.: Decoding of repeated-root cyclic codes up to new bounds on their minimum distance. Prob. Inf. Transm. 51, 217–230 (2015)MathSciNetCrossRefMATH Zeh, A., Ulmschneider, M.: Decoding of repeated-root cyclic codes up to new bounds on their minimum distance. Prob. Inf. Transm. 51, 217–230 (2015)MathSciNetCrossRefMATH
Metadata
Title
On LCD repeated-root cyclic codes over finite fields
Authors
Binbin Pang
Shixin Zhu
Jin Li
Publication date
31-05-2017
Publisher
Springer Berlin Heidelberg
Published in
Journal of Applied Mathematics and Computing / Issue 1-2/2018
Print ISSN: 1598-5865
Electronic ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-017-1118-z

Other articles of this Issue 1-2/2018

Journal of Applied Mathematics and Computing 1-2/2018 Go to the issue

Premium Partner