Generalized sphere-packing bound for subblock-constrained codes

• المؤلفون الرئيسيون: Kiah, Han Mao, Tandon, Anshoo, Motani, Mehul
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2022
• الموضوعات: Science::Mathematics; Subblock-Constrained Codes; Generalized Sphere-Packing Bound
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/159500
• المؤسسة: Nanyang Technological University

We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. À la Fazeli et al. (2015), we make use of automorphisms to significantly reduce the number of variables in the associated linear programming problem. In particular, we study binary constant subblock-compositi...