Author： Brightwell G. Katona Gyula
Publisher： Akademiai Kiado
ISSN： 0081-6906
Source： Studia Scientiarum Mathematicarum Hungarica, Vol.38, Iss.1-4, 2001-12, pp. : 139-147
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
New upper bounds on Enomoto-Katona's coding type problem
Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 1, 2005-02 ,pp. :
Access to resources
Recommend
Coding to Achieve Markov Type Redundancy
STUDIES IN APPLIED MATHEMATICS, Vol. 33, Iss. 1, 1954-04 ,pp. :
Coding to Achieve Markov Type Redundancy
STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1954-04 ,pp. :
On the lot-type design problem
By Gaul Constantin Kurz Sascha Rambau Jorg
Optimization Methods and Software, Vol. 25, Iss. 2, 2010-04 ,pp. :