Skip to search formSkip to main contentSkip to account menu

Plotkin bound

Known as: Plotkin 
In the mathematics of coding theory, the Plotkin bound, named after Morris Plotkin, is a limit (or bound) on the maximum possible number of codewords… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Application of some known methods of code construction (such as the Vasil'ev, Plotkin, and Mollard methods) to transitive codes… 
Highly Cited
2004
Highly Cited
2004
A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is… 
2003
2003
A software toolset which allows unified modelling language (UML) modellers to annotate models with performance information is… 
Review
2002
Review
2002
The C-light language is described, which is a representative subset of C. C-light permits deterministic expressions, limited use… 
2001
2001
In this article, we shall show that the Plotkin-Statman conjecture (Plotkin 1973, Statman 1982) is false. The conjecture was that… 
1998
1998
In this paper we propose a new ILP method Bottom Reduction. It is an extension of Bottom Generalization for treating multiple… 
Highly Cited
1990
Highly Cited
1990
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic… 
1990
1990
I present a theory of program animation based on formal semantics. This theory shows how an animator for a language can be… 
Highly Cited
1976
Highly Cited
1976
mice are discussed by Alfred S. Steinberg who presents data in support of the idea that early loss of a thymic regulatory…