Skip to main content
Home
Text to IPA
Speech to IPA
IPA to Word
IPA Reader
Beta
IPA charts
British English
American English
Mandarin Chinese
IPA charts
A–Z
Blog
toIPA
Home
Text to IPA
Speech to IPA
IPA to Word
IPA Reader
Beta
IPA charts
Full
British English
American English
Mandarin Chinese
IPA charts
A–Z
Blog
🇺🇸 English
🇺🇸 English
🇨🇳 中文
🇯🇵 日本語
🇩🇪 Deutsch
🇫🇷 Français
🇪🇸 Español
🇮🇳 हिन्दी
🇸🇦 العربية
🇧🇩 বাংলা
🇵🇹 Português
🇮🇩 Bahasa Indonesia
🇵🇰 اردو
🇷🇺 Русский
🇻🇳 Tiếng Việt
🇹🇷 Türkçe
🇰🇷 한국어
🇮🇹 Italiano
🇳🇴 Norsk bokmål
🇳🇱 Nederlands
🇵🇱 Polski
🇸🇪 Svenska
🇬🇷 Ελληνικά
🇮🇱 עברית
🇮🇷 فارسی
🇹🇭 ไทย
🇺🇦 Українська
🇨🇿 Čeština
🇧🇾 Беларуская
Home
Plotkin bound
Plotkin bound
limit on the number of codewords in binary codes of given length and minimum distance
en-US
/ˈplɑtkɪn ˈbaʊnd/
en-GB
/plɒtkɪn ˈbaʊnd/
Categories:
inequation
theorem