Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-PM-1-1
Session:
Number:We-PM-1-1.1
Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained Codes
Anshoo Tandon, Han Mao Kiah, Mehul Motani,
pp.617-621
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-1-1.1
PDF download
Summary:
Subblock-constrained codes are an important class of constrained codes, having applications in many diverse fields. In this paper, we provide closed-form expressions for the best known upper bounds on the asymptotic rates of subblock-constrained codes for a range of relative distance values via a generalized sphere-packing approach. In particular, we study binary subblock energy-constrained codes (SECCs), characterized by the property that the number of ones in each subblock exceeds a certain threshold, and binary constant subblock-composition codes (CSCCs), characterized by the property that the number of ones in each subblock is constant. Improved bounds on the optimal asymptotic rate for SECCs and CSCCs are obtained by applying a generalized sphere-packing approach and judiciously choosing appropriate constrained spaces for estimating asymptotic ball sizes. We also use numerical examples to highlight the improvement.