Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Block code
Code
Coding theory
Elias Bassalygo bound
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
On the Construction of Transitive Codes
F. Solov'eva
Problems of Information Transmission
2005
Corpus ID: 36090285
Application of some known methods of code construction (such as the Vasil'ev, Plotkin, and Mollard methods) to transitive codes…
Expand
Highly Cited
2004
Highly Cited
2004
On unequal error protection LDPC codes based on Plotkin-type constructions
Vidya Kumar
,
O. Milenkovic
IEEE Global Telecommunications Conference…
2004
Corpus ID: 6848217
A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is…
Expand
2003
2003
Performance modelling with the Unified Modelling Language and stochastic process algebras
C. Canevet
,
S. Gilmore
,
J. Hillston
,
Matthew Prowse
,
P. Stevens
2003
Corpus ID: 62750668
A software toolset which allows unified modelling language (UML) modellers to annotate models with performance information is…
Expand
Review
2002
Review
2002
Towards Verification of C Programs. C-Light Language and Its Formal Semantics
V. Nepomniaschy
,
I. Anureev
,
I. Mikhailov
,
A. Promsky
Programming and computer software
2002
Corpus ID: 33971426
The C-light language is described, which is a representative subset of C. C-light permits deterministic expressions, limited use…
Expand
2001
2001
The Undecidability of λ-Definability
R. Loader
2001
Corpus ID: 27183899
In this article, we shall show that the Plotkin-Statman conjecture (Plotkin 1973, Statman 1982) is false. The conjecture was that…
Expand
1998
1998
Finding Hypotheses from Examples by Computing the Least Generalization of Bottom Clauses
Kimihito Ito
,
Akihiro Yamamoto
IFIP Working Conference on Database Semantics
1998
Corpus ID: 45979637
In this paper we propose a new ILP method Bottom Reduction. It is an extension of Bottom Generalization for treating multiple…
Expand
1994
1994
An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications
P. Collette
Information Processing Letters
1994
Corpus ID: 41634631
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
Conal Elliott
,
F. Pfenning
1990
Corpus ID: 54154214
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic…
Expand
1990
1990
Generating program animators from programming language semantics
D. Berry
1990
Corpus ID: 38983708
I present a theory of program animation based on formal semantics. This theory shows how an animator for a language can be…
Expand
Highly Cited
1976
Highly Cited
1976
Combined Immunodeficiency Disease and Adenosine Deaminase Deficiency. A Molecular Defect
A. Baumgarten
The Yale Journal of Biology and Medicine
1976
Corpus ID: 44874077
mice are discussed by Alfred S. Steinberg who presents data in support of the idea that early loss of a thymic regulatory…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE