A simple proof of the improved johnson bound for binary codes

TNG Le, TT Phan - Bulletin of the Korean Mathematical Society, 2019 - koreascience.kr
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES 1. The
improved Johnson bound for A(n, d) Let F = {0, 1} and let n Page 1 Bull. Korean Math. Soc. 56 …
被引用次数：2 相关文章

A simple proof of the improved Johnson bound for binary codes

PT Le Thi Ngoc Giau - 대한수학회보, 2019 - kiss.kstudy.com
A simple proof of the improved Johnson bound for binary codes - 대한수학회보 - 대한수학회
- KISS 34.64.82.75 회원가입 로그인 고객센터 한국어 ENG 지식을 담다. 지식을 나누다 KISS …

A simple proof of the improved Johnson bound for binary codes

PT Toan - Bulletin of the Korean Mathematical Society, 2019 - bkms.kms.or.kr
A simple proof of the improved Johnson bound for binary codes 닫기 ABOUT THE BKMS
About this Journal Editorial Board Open Access VIEW ARTICLES Current Issue All Issues …

A simple proof of the improved Johnson bound for binary codes

PT Toan - Bulletin of the Korean Mathematical Society, 2019 - bkms.kms.or.kr
A simple proof of the improved Johnson bound for binary codes 닫기 ABOUT THE BKMS
About this Journal Editorial Board Open Access VIEW ARTICLES Current Issue All Issues …