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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A q-ary code of length n is termed an equitable symbol weight code, if each symbol appears among the coordinates of every… (More)
  • table 1
Is this relevant?
2013
2013
In this paper, we re-introduce from our previous work [1] a new family of nonlinear codes, called weak flip codes, and show that… (More)
Is this relevant?
2009
2009
We derive an upper bound for the cardinality of multiple packing in the case of large decoding radius 
Is this relevant?
2007
2007
The effectiveness of quasi-Monte Carlo methods for numerical integration has led to the study of (T,M,S)-nets, which are… (More)
Is this relevant?
2004
2004
This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. We… (More)
  • figure 1
Is this relevant?
2003
2003
In coding theory, Plotkin’s upper bound on the maximal cadinality of a code with minimum distance at least d is well known. He… (More)
Is this relevant?
2002
2002
In this thesis codes are considered which are exclusively generated by the |u|u+v|-construction, also known as P LOTKIN… (More)
Is this relevant?
Review
2001
Review
2001
Let A(n, d) denote the greatest number of codewords possible in a binary block code of length n and distance d. Plotkin gave a… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
The general aim of this paper is to find a theory of concurrency combining the approaches of Petri and Scott (and others). In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?