Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
Information Theory
2014-11-11 v1 Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.1411.2513,
title = {Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes},
author = {Yeow Meng Chee and Han Mao Kiah and Hui Zhang and Xiande Zhang},
journal= {arXiv preprint arXiv:1411.2513},
year = {2014}
}