Premium
Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Author(s) -
Chee Y. M.,
Kiah H. M.,
Ling A. C. H.,
Wang C.
Publication year - 2015
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21398
Subject(s) - tournament , mathematics , narrowband , alphabet , combinatorial design , code (set theory) , line (geometry) , symbol (formal) , power (physics) , combinatorics , discrete mathematics , telecommunications , computer science , linguistics , philosophy , physics , geometry , set (abstract data type) , quantum mechanics , programming language
Generalized balanced tournament packings (GBTPs) extend the concept of generalized balanced tournament designs introduced by Lamken and Vanstone (1989). In this paper, we establish the connection between GBTPs and a class of codes called equitable symbol weight codes (ESWCs). The latter were recently demonstrated to optimize the performance against narrowband noise in a general coded modulation scheme for power line communications. By constructing classes of GBTPs, we establish infinite families of optimal ESWCs with code lengths greater than alphabet size and whose narrowband noise error‐correcting capability to code length ratios do not diminish to zero as the length grows.