- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 A simple proof of the improved Johnson bound for binary codes Bull. Korean Math. Soc. 2019 Vol. 56, No. 2, 391-397 https://doi.org/10.4134/BKMS.b180284Published online March 1, 2019 Le Thi Ngoc Giau, Phan Thanh Toan Ton Duc Thang University; Ton Duc Thang University Abstract : In this paper, we give a simple proof of the improved Johnson bound for $A(n,d)$, the maximum number of codewords in a binary code of length $n$ and minimum distance $d$, given by Mounits, Etzion and Litsyn. Keywords : binary code, Johnson bound, upper bound MSC numbers : 94B65 Downloads: Full-text PDF   Full-text HTML