Explicit construction of optimal constant-weight codes for identification via channels

1993 ◽  
Vol 39 (1) ◽  
pp. 30-36 ◽  
Author(s):  
S. Verdu ◽  
V.K. Wei
10.37236/1014 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
I. Gashkov ◽  
D. Taub

In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by filling in 9 missing constant weight codes, all of which are optimal by the second Johnson bound. This completes the tables for $A(n,16,9)$ and $A(n,18,10)$ up to $n=63$ and corrects some $A(n,14,8)$.


2018 ◽  
Vol 17 (02) ◽  
pp. 1850027 ◽  
Author(s):  
Hsin-Min Sun

We introduce some sequences of binary constant weight codes which are constructed from the affine constructions of balanced incomplete block designs. They give the values for the function [Formula: see text] of constant weight codes, and they are optimal since those values reach the Johnson Bound. We focus on the values obtained by this method.


2014 ◽  
Vol 60 (11) ◽  
pp. 7026-7034 ◽  
Author(s):  
Yeow Meng Chee ◽  
Zouha Cherif ◽  
Jean-Luc Danger ◽  
Sylvain Guilley ◽  
Han Mao Kiah ◽  
...  

1985 ◽  
Vol 11 (3) ◽  
pp. 307-310 ◽  
Author(s):  
Iiro Honkala ◽  
Heikki Hämäläinen ◽  
Markku Kaikkonen

1995 ◽  
Vol 41 (2) ◽  
pp. 448-455 ◽  
Author(s):  
O. Moreno ◽  
Zhen Zhang ◽  
P.V. Kumar ◽  
V.A. Zinoviev

Sign in / Sign up

Export Citation Format

Share Document