Paper Info
Title
New Constant Weight Codes and Packing Numbers.
Abstract
The constant A(n,d,w) is the maximum number of words in an (n,d,w) binary code, that is, a code of minimal distance d, with words of length n and weight w. We improve the best known lower bounds on A(n,d,w) for three sets of parameters by using optimization; in particular, we show that A(29,8,5)≥36, A(30,8,5)≥41, and A(32,8,5)=44 by explicitly giving the respective codes. The (32, 8, 5) code is optimal and leads to eight more new optimal codes. We show this by improving the known result on the problem of finding the packing number P(v,5,2) for v≡12 (mod 20).
Year
DOI
Venue
2018
10.1016/j.endm.2018.02.017
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
packing,constant weight code,optimization
Discrete mathematics,Mod,Combinatorics,Binary code,Code (cryptography),Mathematics
Journal
Volume
ISSN
Citations 
65
1571-0653
0
PageRank 
References 
Authors
0.34
2
1
Name
Order
Citations
PageRank
iliya bluskov173.88