On enumeration of q -ary sequences with a fixed number of occurrences of the subblock 00

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.46, Iss.4, 2010-12, pp. : 376-381

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Construction of the weight polynomial for autocorrelation of q -ary words

By Gogin N. Mylläri A.

Programming and Computer Software, Vol. 37, Iss. 2, 2011-03 ,pp. : 104-112

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the Number of t-Ary Trees with a Given Path Length

By Seroussi Gadiel

Algorithmica, Vol. 46, Iss. 3-4, 2006-11 ,pp. : 557-565

Springer Publishing Company

Access to resources Recommend Favorite

DNF tautologies with a limited number of occurrences of every variable

By Savicky

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 495-498

Elsevier

Access to resources Recommend Favorite

On the number of occurrences of a symbol in words of regular languages

By Bertoni A. Choffrut C. Goldwurm M. Lonati V.

Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. : 431-456

Elsevier

Access to resources Recommend Favorite

Fast Broadcasting and Gathering in q-ary Cubes Using Error-Correction Codes

By Latifi S.

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 1, 1998-01 ,pp. : 52-63

Academic Press

Access to resources Recommend Favorite