nach oben

Designs, Codes and Cryptography

Erschienen in:

01.10.2016

Complete weight enumerators of some linear codes and their applications

verfasst von: Chengju Li, Sunghan Bae, Jaehyun Ahn, Shudi Yang, Zheng-An Yao

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2016

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

Recently, linear codes constructed from defining sets have been extensively studied. It was shown that the linear codes may have a few nonzero weights or be optimal if the defining sets are well chosen. The weight enumerators of these linear codes were also presented. In this paper, we investigate the complete weight enumerators of some linear codes constructed from the defining sets. As applications, we employ the explicit complete weight enumerators of the linear codes to construct constant composition codes and systematic authentication codes. A new class of optimal constant composition codes and three classes of asymptotically optimal systematic authentication codes are presented.

Vorheriger Artikel New infinite series of 2-designs over the binary and ternary field

Nächster Artikel A generalization of Kung’s theorem

Bae S., Li C., Yue Q.: On the complete weight enumerator of some reducible cyclic codes. Discret. Math. 338, 2275–2287 (2015).

Baumert L.D., McEliece R.J.: Weights of irreducible cyclic codes. Inf. Control 20(2), 158–175 (1972).

Berndt B., Evans R., Williams K.: Gauss and Jacobi Sums. Wiley, New York (1997).

Blake I.F., Kith K.: On the complete weight enumerator of Reed-Solomon codes. SIAM J. Discret. Math. 4(2), 164–171 (1991).

Cai H., Zeng X., Helleseth T., Tang X., Yang Y.: A new construction of zero-difference balanced functions and its applications. IEEE Trans. Inf. Theory 59(8), 5008–5015 (2013).

Chu W., Colbourn C.J., Dukes P.: On constant composition codes. Discret. Appl. Math. 154, 912–929 (2006).

Coulter R.S.: Further evaluation of some Weil sums. Acta Arith. 86, 217–226 (1998).

Ding Y.: A construction for constant-composition codes. IEEE Trans. Inf. Theory 54(8), 3738–3741 (2008).

Ding C.: Optimal constant composition codes from zero-difference balanced functions. IEEE Trans. Inf. Theory 54(12), 5766–5770 (2008).

10.

Ding C.: A class of three-weight and four-weight codes. In: Xing C., et al. (eds.) Proceedings of the Second International Workshop on Coding Theory and Cryptography. Lecture Notes in Computer Science, vol. 5557, pp. 34–42. Springer, Berlin (2009).

11.

Ding C.: Codes from Difference Sets. World Scientific, Singapore (2014).

12.

Ding C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61(6), 3265–3275 (2015).

13.

Ding K., Ding C.: Binary linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014).

14.

Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory (2015). doi:10.1109/TIT.2015.2473861.

15.

Ding C., Niederreiter H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274–2277 (2007).

16.

Ding C., Wang X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005).

17.

Ding C., Yin J.: Algebraic constructions of constant composition codes. IEEE Trans. Inf. Theory 51(4), 1585–1589 (2005).

18.

Ding C., Yuan J.: A family of optimal constant-composition codes. IEEE Trans. Inf. Theory 51(10), 3668–3671 (2005).

19.

Ding C., Fu F.W., Kløve T., Wei V.W.K.: Constructions of permutation arrays. IEEE Trans. Inf. Theory 48(4), 977–980 (2002).

20.

Ding C., Helleseth T., Kløve T., Wang X.: A general construction of authentication codes. IEEE Trans. Inf. Theory 53(6), 2229–2235 (2007).

21.

Ding C., Luo J., Niederreiter H.: Two-weight codes punctured from irreducible cyclic codes. In: Li Y., et al. (eds.) Proceedings of the First Worshop on Coding and Cryptography, pp. 119–124. World Scientific, Singapore (2008).

22.

Ding C., Wang Q., Xiong M.: Three new classes of zero-difference balanced functions with applications. IEEE Trans. Inf. Theory 60(4), 2407–2413 (2014).

23.

Feng K., Luo J.: Weight distribution of some reducible cyclic codes. Finite Fields Appl. 14, 390–409 (2008).

24.

Feng T., Momihara K., Xiang Q.: Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. Combinatorica 35(4), 413–434 (2015).

25.

Fu F.W., Kløve T.: Two constructions of permutation arrays. IEEE Trans. Inf. Theory 50(5), 881–883 (2004).

26.

Gao F., Ge G.: Optimal ternary constant composition codes of weight four and distance five. IEEE Trans. Inf. Theory 57(6), 3742–3757 (2011).

27.

Helleseth T., Kholosha A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018–2032 (2006).

28.

Ireland K., Rosen M.: A Classical Introduction to Modern Number Theory, 2nd edn. GTM 84, Springer, Berlin (1990).

29.

Kith K.: Complete weight enumeration of Reed-Solomon codes. Master’s Thesis, Department of Electrical and Computing Engineering, University of Waterloo, Waterloo, Ontario, Canada (1989).

30.

Kuzmin A.S., Nechaev A.A.: Complete weight enumerators of generalized Kerdock code and linear recursive codes over Galois rings. In: Proceedings of the WCC99 Workshop on Coding and Cryptography, pp. 332–336, Paris, France, 11–14 January (1999)

31.

Kuzmin A.S., Nechaev A.A.: Complete weight enumerators of generalized Kerdock code and related linear codes over Galois rings. Discret. Appl. Math. 111, 117–137 (2001).

32.

Li C., Yue Q., Fu F.W.: Complete weight enumerators of some cyclic codes. Des. Codes Cryptogr. (2015). doi:10.1007/s10623-015-0091-5.

33.

Lidl R., Niederreiter H.: Finite Fields. Addison-Wesley, London (1983).

34.

Luo J., Helleseth T.: Constant composition codes as subcodes of cyclic codes. IEEE Trans. Inf. Theory 57(11), 7482–7488 (2011).

35.

Luo J., Tang Y.: A new class of constant composition codes. In Proceedings of International Workshop on Signal Design and Its Applications, Fukuoka, Japan, pp. 138–140 (2009).

36.

Luo Y., Fu F.W., Vinck A.J.H., Chen W.: On constant composition codes over \({\mathbb{Z}}_q\). IEEE Trans. Inf. Theory 49(11), 3010–3016 (2003).

37.

Ma S.L.: A survey of partial difference sets. Des. Codes Cryptogr. 4, 221–261 (1994).

38.

MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).

39.

MacWilliams F.J., Mallows C.L., Sloane N.J.A.: Generalizations of Gleason’s theorem on weight enumerators of self-dual codes. IEEE Trans. Inf. Theory 18(6), 794–805 (1972).

40.

Milenkovic O., Kashyap N.: On the Design of Codes for DNA Computing. Lecture Notes in Computer Science, vol. 3969. Springer, Berlin (2006).

41.

Rees R.S., Stinson D.R.: Combinatorial Characterizations of Authentication Codes. Des. Codes Cryptogr. 7, 239–259 (1996).

42.

Simmons G.J.: Authentication Theory/Coding Theory. In: Advances in Cryptology—CRYPTO’84. Lecture Notes in Computer Science, vol. 196, pp. 411–431. Springer, Berlin (1984).

43.

Xiang Q.: Recent progress in algebraic design theory. Finite Fields Appl. 11, 622–653 (2005).

44.

Yan J., Yin J.: A class of optimal constant composition codes from GDRP. Des. Codes Cryptogr. 50, 61–76 (2009).

45.

Yang J., Xia L.: Complete solving of the explicit evaluation of Gauss sums in the index 2 case. Sci. China Math. 53(9), 2525–2542 (2010).

Titel: Complete weight enumerators of some linear codes and their applications
verfasst von: Chengju Li
Sunghan Bae
Jaehyun Ahn
Shudi Yang
Zheng-An Yao
Publikationsdatum: 01.10.2016
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 1/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-015-0136-9

Springer Professional

Complete weight enumerators of some linear codes and their applications

Abstract

Premium Partner

Springer Professional

Abstract

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

Weitere Artikel der Ausgabe 1/2016

Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even–Mansour

Switched symplectic graphs and their 2-ranks

Policy-based signature scheme from lattices

Graph-theoretic design and analysis of key predistribution schemes

homomorphic hash functions: worst case to average case reduction and short collision search

A generalization of Kung’s theorem

Premium Partner