Constant Composition Codes as Subcodes of Linear Codes
Information Theory
2017-06-23 v2 math.IT
Abstract
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on LVFC bound. On the other hand, a class of constant composition codes is derived from known linear codes.
Cite
@article{arxiv.1706.06997,
title = {Constant Composition Codes as Subcodes of Linear Codes},
author = {Long Yu and Xiusheng Liu},
journal= {arXiv preprint arXiv:1706.06997},
year = {2017}
}
Comments
13pages