Bull. Korean Math. Soc. 2019; 56(2): 391-397
Online first article July 4, 2018 Printed March 1, 2019
https://doi.org/10.4134/BKMS.b180284
Copyright © The Korean Mathematical Society.
Le Thi Ngoc Giau, Phan Thanh Toan
Ton Duc Thang University; Ton Duc Thang University
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
Supported by: This research is funded by Foundation for Science and Technology Development of Ton Duc Thang University (FOSTECT), website: http://fostect.tdtu.edu.vn, under Grant FOSTECT.2017.BR.02.
2021; 58(6): 1315-1325
2018; 55(3): 735-747
1996; 33(3): 397-409
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd