JOURNAL ARTICLE

Some combinatorial identities.

  • Published In: Asian-European Journal of Mathematics, 2024, v. 17, n. 1. P. 1 1 of 3

  • Database: Mathematics Source 2 of 3

  • Authored By: Kumar, Pankaj; Riddhi 3 of 3

Abstract

In this paper, it is shown that a positive integer t can be written as t = ∑ i = 0 r − 1 (− 1) i (r − 1 , i) (t + r − 1 − i , r). It is also proved that the two expressions for number of codewords of weight t , obtained in Theorem 1[P. Kumar, M. Sangwan and S. K. Arora, The weight distributions of some irreducible cyclic codes of length p n and 2 p n , Adv. Math. Commun.9 (2015) 277–289] and in Theorem 1 Case (i)[G. Vega, The weight distribution for any irreducible cyclic code of length p m , Appl. Algebra Eng. Commun. Comput.29(4) (2018) 363–370] are same. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Asian-European Journal of Mathematics. 2024/01, Vol. 17, Issue 1, p1
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2024
  • ISSN:1793-5571
  • DOI:10.1142/S1793557123502431
  • Accession Number:175445624
  • Copyright Statement:Copyright of Asian-European Journal of Mathematics is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.