A simple proof of the improved Johnson bound for binary codes
Bull. Korean Math. Soc.
Published online 2018 Jul 04
Le Thi Ngoc Giau, and Phan Thanh Toan
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
Full-Text :

   

Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang.co., Ltd