Constant Composition Codes as Subcodes of Linear Codes
Long Yu, Xiusheng Liu
TL;DR
This paper constructs constant composition codes from linear codes, including optimal ones, and introduces new classes of such codes with specific weight properties, advancing coding theory.
Contribution
It presents new methods to derive constant composition codes from linear codes, including optimal codes, expanding the toolkit for code construction.
Findings
Constructed linear codes with one or two weights.
Developed two classes of constant composition codes from these linear codes.
Included optimal constant composition codes based on LVFC bound.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIslamic Finance and Communication · Coding theory and cryptography