Estimates on the Size of Symbol Weight Codes

DOI10.1109/TIT.2012.2214434zbMATH Open1364.94671arXiv1110.0911OpenAlexW2012078194MaRDI QIDQ2989460FDOQ2989460

Authors: Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The study of codes for powerlines communication has garnered much interest over the past decade. Various types of codes such as permutation codes, frequency permutation arrays, and constant composition codes have been proposed over the years. In this work we study a type of code called the bounded symbol weight codes which was first introduced by Versfeld et al. in 2005, and a related family of codes that we term constant symbol weight codes. We provide new upper and lower bounds on the size of bounded symbol weight and constant symbol weight codes. We also give direct and recursive constructions of codes for certain parameters.

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited In (2)

• Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
• Approximate generalized Steiner systems and near-optimal constant weight codes

This page was built for publication: Estimates on the Size of Symbol Weight Codes

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