Two series of equitable symbol weight codes meeting the Plotkin bound
A \(q\)-ary code of length \(n\) is termed an equitable symbol weight code, if each symbol appears among the coordinates of every codeword either \(\lfloor n/q \rfloor \) or \(\lceil n/q \rceil \) times. This class of codes was proposed recently by Chee et al. in order to more precisely capture a codes performance against permanent narrowband noise in power line communication. In this paper, two series of new equitable symbol weight codes of optimal sizes meeting the Plotkin bound are constructed via combinatorial designs.
equitable symbol weight codes optimality designs primary 05b05 94b25