On relative constant-weight codes

2013 ◽  
Vol 75 (1) ◽  
pp. 127-144 ◽  
Author(s):  
Zihui Liu ◽  
Xin-Wen Wu
Keyword(s):  
Constant Weight Codes ◽  
Constant Weight ◽  
Relative Constant

scholarly journals Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions

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

scholarly journals A modification of the Zinoviev lower bound for constant weight codes

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

New constructions of optimal cyclically permutable constant weight codes

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

On the Svanstrom bound for ternary constant-weight codes

2001 ◽  
Vol 47 (5) ◽  
pp. 2061-2064 ◽  
Author(s):  
Fang-Wei Fu ◽  
T. Klove ◽  
Yuan Luo ◽  
V.K. Wei
Keyword(s):  
Constant Weight Codes ◽  
Constant Weight

Perfect Constant-Weight Codes

2004 ◽  
Vol 50 (9) ◽  
pp. 2156-2165 ◽  
Author(s):  
T. Etzion ◽  
M. Schwartz
Keyword(s):  
Constant Weight Codes ◽  
Constant Weight

On the Construction of Multiply Constant-Weight Codes

2021 ◽  
pp. 1-10
Author(s):  
Jiejing Wen ◽  
Fang-Wei Fu
Keyword(s):  
Constant Weight Codes ◽  
Constant Weight ◽  
Outer Code ◽  
Plotkin Bound ◽  
Johnson Bound

Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, two methods of constructing MCWCs are presented following the concatenation methodology. In other words, MCWCs are constructed by concatenating approximate outer codes and inner codes. Besides, several classes of optimal MCWCs are derived from these methods. In the first method, the outer codes are [Formula: see text]-ary codes and the inner codes are constant-weight codes over [Formula: see text]. Furthermore, if the outer code achieves the Plotkin bound and the inner code achieves Johnson bound, then the resulting MCWC is optimal. In the second method, the outer codes are [Formula: see text]-ary codes and the inner codes are MCWCs. Furthermore, if the outer code achieves the Plotkin bound and the inner code achieves the Johnson bound, then the resulting MCWC is optimal.

The Probability of Undetected Error for Binary Constant-Weight Codes

2005 ◽  
Vol 51 (9) ◽  
pp. 3364-3373 ◽  
Author(s):  
S.-T. Xia ◽  
F.-W. Fu ◽  
Y. Jiang ◽  
S. Ling
Keyword(s):  
Constant Weight Codes ◽  
Constant Weight ◽  
Binary Constant Weight Codes
Sign in / Sign up

Export Citation Format

Share Document