nach oben

Designs, Codes and Cryptography

Erschienen in:

11.10.2018

Totally decomposed cumulative Goppa codes with improved estimations

verfasst von: Sergey Bezzateev, Natalia Shekhunova

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2-3/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

A class of q-ary totally decomposed cumulative \(\varGamma (L,G^{j})\)-codes with \(L=\{ \alpha \in :G(\alpha )\ne 0 \}\) and \(G^{j}=G^{j}(x),\; 1 \le j\le q\), where G(x) is a polynomial totally decomposed in \(GF(q^{m})\), are considered. The relation between different codes from this class is studied. Improved bounds of the minimum distance and dimension are obtained.

Vorheriger Artikel Improved syndrome decoding of lifted -interleaved Gabidulin codes

Nächster Artikel Improved power decoding of interleaved one-point Hermitian codes

Bernstein D.J., Lange T., Peters C.: Wild McEliece incognito. In: Yang B.Y. (ed.) Post-Quantum Cryptography, pp. 244–254. Springer, Berlin (2011).CrossRef

Bezzateev S., Shekhunova N.: On the subcodes of one class Goppa codes. In: Proc. Intern. Workshop Algebraic and Combinatorial Coding Theory, pp. 143–146 (1988).

Bezzateev S., Shekhunova N.: Subclass of binary Goppa codes with minimal distance equal to the design distance. IEEE Trans. Inf. Theory 41(2), 554–555 (1995).MathSciNetCrossRefMATH

Bezzateev S.V., Shekhunova N.A.: Quasi-cyclic Goppa codes. In: Proceedings of 1995 IEEE International Symposium on Information Theory, p. 499 (1995).

Bezzateev S., Shekhunova N.: Subclass of non-binary cumulative Goppa codes. In: The 9th International Conference on Finite Fields and Their Applications, p. 7. University College Dublin. http://claudeshannoninstitute.ucd.ie/fq9/AllFq9Abstracts.pdf (2009).

Bezzateev S., Shekhunova N.: Cumulative-separable codes. arXiv:1005.1524v1 (2010).

Bezzateev S., Shekhunova N.: Special classes of Goppa codes with improved estimations for parameters. Probl. Peredachi Inf. 46(3), 29–50 (2010).MathSciNetMATH

Couvreur A., Otmani A., Tillich J.P.: New identities relating wild Goppa codes. Finite Fields Appl. 29, 178–197 (2014). https://doi.org/10.1016/j.ffa.2014.04.007.MathSciNetCrossRefMATH

Goppa V.: A new class of linear error correcting codes. Probl. Peredachi Inf. 6(3), 24–30 (1970).MathSciNetMATH

10.

Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de (2007). Accessed 16 June 2018

11.

MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes. North-Holland Publishing Co, Amsterdam. https://www.elsevier.com/books/the-theory-of-error-correcting-codes/macwilliams/978-0-444-85193-2 (1977).

12.

Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T.: Further results on Goppa codes and their applications to constructing efficient binary codes. IEEE Trans. Inf. Theory 22(5), 518–526 (1976). https://doi.org/10.1109/TIT.1976.1055610.MathSciNetCrossRefMATH

Titel: Totally decomposed cumulative Goppa codes with improved estimations
verfasst von: Sergey Bezzateev
Natalia Shekhunova
Publikationsdatum: 11.10.2018
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 2-3/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-018-0566-2

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 2-3/2019

Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile

Combinatorial metrics: MacWilliams-type identities, isometries and extension property

On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures

Duplication-correcting codes

The graph structure of Chebyshev polynomials over finite fields and applications

The covering radii of a class of binary cyclic codes and some BCH codes