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

DOI10.1002/JCD.21398zbMATH Open1310.05107arXiv1304.0278OpenAlexW1519510634MaRDI QIDQ5249059FDOQ5249059

Authors:

Publication date: 29 April 2015

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

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.

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

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

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)

Cites Work

• On the maximum number of permutations with given maximal or minimal distance
• The existence of doubly resolvable \((v,3,2)\)-BIBDs
• Cyclotomy and difference families in elementary Abelian groups
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• A construction of optimal constant composition codes
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Generalized balanced tournament designs and related codes
• Existence results for generalized balanced tournament designs with block size 3
• Constructions for generalized balanced tournament designs
• Generalized Balanced Tournament Designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The existence of partitioned generalized balanced tournament designs with block size 3
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
• Equidistant frequency permutation arrays and related constant composition codes
• On the construction of \(q\)-ary equidistant codes
• Balanced tournament designs and related topics
• Coding with injections
• Error-correcting codes over an alphabet of four elements

Cited In (5)

• Optimal almost equisymbol codes based on difference matrices
• The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Constructions for permutation codes in powerline 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)