Volume 26 Issue 3
Jan.  2018
Article Contents

Pu Heping. A Class of Combinatorial Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1997, 26(3): 303-307.
Citation: Pu Heping. A Class of Combinatorial Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1997, 26(3): 303-307.

A Class of Combinatorial Counting Problems

  • Received Date: 1996-06-27
  • Publish Date: 1997-06-15
  • In this paper,soml problems of counting the n umber of m level digital sequlnces of length n that satisfy some constraints are considered and their recursive formulas and explicit formulations arl given.A result of combinatorial lnumlration of kly codlwords is improved and some combinatorial identical relations are got.
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article Metrics

Article views(3461) PDF downloads(48) Cited by()

Related
Proportional views

A Class of Combinatorial Counting Problems

Abstract: In this paper,soml problems of counting the n umber of m level digital sequlnces of length n that satisfy some constraints are considered and their recursive formulas and explicit formulations arl given.A result of combinatorial lnumlration of kly codlwords is improved and some combinatorial identical relations are got.

Pu Heping. A Class of Combinatorial Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1997, 26(3): 303-307.
Citation: Pu Heping. A Class of Combinatorial Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1997, 26(3): 303-307.

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return