# Plotkin bound

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Des. Codes Cryptography
- 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)

Is this relevant?

2013

2013

- IEEE International Symposium on Informationâ€¦
- 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

- IEEE International Symposium on Informationâ€¦
- 2009

We derive an upper bound for the cardinality of multiple packing in the case of large decoding radiusÂ

Is this relevant?

2007

2007

- IEEE Transactions on Information Theory
- 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

- Electr. Notes Theor. Comput. Sci.
- 2004

This paper studies a simple calculus for finite-state processes featuring both nondeterministic and probabilistic choice. Weâ€¦Â (More)

Is this relevant?

2003

2003

- Electr. J. Comb.
- 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

- 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

- IEEE Trans. Information Theory
- 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

- LICS
- 1989

The Î»-calculus is considered an useful mathematical tool in the study of programming languages. However, if one usesâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Theor. Comput. Sci.
- 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)

Is this relevant?