Everything about Plotkin bound

🧭 Start here: a 6-step reading path

1. Read the overview: Plotkin boundA 5-minute orientation
2. Pick up a classic book: Contemporary authorsThe most-reprinted book on the subject
3. Read the landmark paper: Linear Plotkin bound for entanglement-assisted quantum codesCited 38 times
4. Go sideways: Johnson boundA closely related topic
5. Go sideways: AN codesA closely related topic

🏆 Landmark papers (most cited)

• Linear Plotkin bound for entanglement-assisted quantum codes

  Luobin Guo, Ruihu Li · 2013 · Physical Review A · 38 citations

• Bounds for binary codes just outside the plotkin range

  Aimo Tietäväinen · 1980 · Information and Control · 13 citations

• A Dual Plotkin Bound for $(T,M,S)$-Nets

  William J. Martin, Terry I. Visentin · 2007 · IEEE Transactions on Information Theory · 6 citations

• Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels

  K. Hareesh, N. T. Rashid Ummer, B. Sundar Rajan · 2026 · IEEE Transactions on Information Theory · 5 citations

• Some Remarks on the Plotkin Bound

  Jörn Quistorff · 2003 · The Electronic Journal of Combinatorics · 3 citations

• Plotkin bound generalization to the case of multiple packings

  V. M. Blinovsky · 2009 · Problems of Information Transmission · 2 citations

• Two series of equitable symbol weight codes meeting the Plotkin bound

  Peipei Dai, Jianmin Wang, Jianxing Yin · 2013 · Designs, Codes and Cryptography · 2 citations

• The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes

  Yinghao Liang, Zihui Liu · 2024 · IEEE Transactions on Information Theory · 2 citations

📚 Books worth reading

• Contemporary authorsAmy Elisabeth Fuller · 2007
• 📕Bounds for binary and nonbinary codes slightly outside of the Plotkin rangeAntti Perttula · 1982

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Johnson bound In applied mathematics, the Johnson bound (named after Selmer Martin Johnson) is a limit on the size of error-correcting codes, as used in coding theory…
• AN codes AN codes are error-correcting code that are used in arithmetic applications. Arithmetic codes were commonly used in computer processors to ensure the accuracy…
• Hamming bound In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also…
• Binary Goppa code In mathematics and computer science, the binary Goppa code is an error-correcting code that belongs to the class of general Goppa codes originally described…
• Classical capacity In quantum information theory, the classical capacity of a quantum channel is the maximum rate at which classical data can be sent over it error-free in…
• Generalized minimum-distance decoding In coding theory, generalized minimum-distance (GMD) decoding provides an efficient algorithm for decoding concatenated codes, which is based on using…
• Singleton bound In coding theory, the Singleton bound, named after the American mathematician Richard Collom Singleton (1928–2007), is a relatively crude upper bound on…
• Merge-insertion sort In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer…