Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes

DOI10.1109/TIT.2017.2690450MaRDI QIDQ4682971zbMATH OpenFDO

Authors Yeow Meng Chee, Han Mao Kiah, Hui Zhang, Xian De Zhang

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.2513

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson type upper bounds of MCWCs are asymptotically tight for fixed weights and distances. Finally, we provide bounds and constructions of two dimensional MCWCs.

Cited in

(10)

• Optimal multiply constant-weight codes from generalized Howell designs
• On existence of two classes of generalized Howell designs with block size three and index two
• On generalized Howell designs with block size three
• Frames and doubly resolvable group divisible designs with block size three and index two
• A generalization of group divisible t t‐designs
• A unified construction of optimal and distance optimal two or three-weight codes
• On the Construction of Multiply Constant-Weight Codes
• Constructions of optimal multiply constant-weight codes MCWC(3,n₁; 1,n₂; 1,n₃; 8)s
• On generalized Howell designs with block size four and their applications to multiply constant-weight codes
• Generalized group divisible covering designs

This page was built for publication: Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682971)