Bounds on the size and asymptotic rate of subblock-constrained codes

The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary constant subblock-composition codes (CSCCs), where each codewor...

Полное описание

Библиографические подробности
Главные авторы: Tandon, Anshoo, Kiah, Han Mao, Motani, Mehul
Другие авторы: School of Physical and Mathematical Sciences
Формат: Journal Article
Язык:English
Опубликовано: 2020
Предметы:
Online-ссылка:https://hdl.handle.net/10356/144707