Code bounds for multiple packings over a nonbinary finite alphabet

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.41, Iss.1, 2005-01, pp. : 23-32

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

On the asymptotic average length of a maximum common subsequence for words over a finite alphabet

By Tomescu I.

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 277-285

Elsevier

Access to resources Recommend Favorite

Upper and lower bounds of op-code probabilities for Edgebreaker

By Cho Cheol-Hyung Kim Deok-Soo Cho Youngsong Ryu Joonghyun

International Journal of Computational Science and Engineering, Vol. 3, Iss. 1, 2007-07 ,pp. : 23-28

Inderscience Publishers

Access to resources Recommend Favorite

On finding minimal, maximal, and consistent sequences over a binary alphabet

By M. Nivat Middendorf M.

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 317-327

Elsevier

Access to resources Recommend Favorite

Exact Bounds on Finite Populations of Interval Data

By Ferson Scott Ginzburg Lev Kreinovich Vladik Longpré Luc Aviles Monica

Reliable Computing, Vol. 11, Iss. 3, 2005-06 ,pp. : 207-233

Springer Publishing Company

Access to resources Recommend Favorite

Lower bounds for some decision problems over C

By Malajovich

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 425-434

Elsevier

Access to resources Recommend Favorite