Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications

DOI10.1002/JCD.21398MaRDI QIDQ5249059zbMATH OpenOpenAlexFDO

Authors

Publication date 29 April 2015

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.0278

zbMATH Keywords

equitable symbol weight codespower line communicationsgeneralized balanced tournament designsgeneralized balanced tournament packings

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: Generalized balance 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. 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 equitable symbol weight codes 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.

Recommendations

• Generalized balanced tournament designs and related codes
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Asymptotic existence of frame-GBTDs
• The existence of near generalized balanced tournament designs
• Generalized Balanced Tournament Designs

Cites work

• scientific article; zbMATH DE number 3621745 (Why is no real title available?)
• scientific article; zbMATH DE number 3438734 (Why is no real title available?)
• A construction of optimal constant composition codes
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Balanced tournament designs and related topics
• Coding with injections
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Constructions for generalized balanced tournament designs
• Cyclotomy and difference families in elementary Abelian groups
• Equidistant frequency permutation arrays and related constant composition codes
• Error-correcting codes over an alphabet of four elements
• Existence results for generalized balanced tournament designs with block size 3
• Generalized Balanced Tournament Designs
• Generalized balanced tournament designs and related codes
• Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
• On the construction of q-ary equidistant codes
• On the maximum number of permutations with given maximal or minimal distance
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• The existence of doubly resolvable \((v,3,2)\)-BIBDs
• The existence of partitioned generalized balanced tournament designs with block size 3

Cited in

(5)

• Optimal almost equisymbol codes based on difference matrices
• The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Constructions for permutation codes in powerline communications
• Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications

This page was built for publication: Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249059)