New Explicit Binary Constant Weight Codes from Reed-Solomon Codes

TL;DR

This paper introduces a new explicit construction method for binary constant weight codes using Reed-Solomon codes, resulting in optimal or improved codes with practical applications.

Contribution

The paper presents a novel construction of binary constant weight codes from Reed-Solomon codes, including new optimal codes and improvements over existing bounds.

Findings

Constructed new binary constant weight codes with parameters A(64,10,8) ≥ 4108 and A(64,12,8) ≥ 522.

Provided explicit codes that surpass Gilbert and Graham-Sloane bounds.

Extended the construction method to algebraic geometric codes.

Abstract

Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from $q$-ary Reed-Solomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant weight codes $A(64, 10, 8) \geq 4108$ and $A(64, 12, 8) \geq 522$ are constructed. We also give explicitly constructed binary constant weight codes which improve Gilbert and Graham-Sloane lower bounds in some range of parameters. An extension to algebraic geometric codes is also presented.