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...
Saved in:
Main Authors: | Tandon, Anshoo, Kiah, Han Mao, Motani, Mehul |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/144707 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Generalized sphere-packing bound for subblock-constrained codes
由: Kiah, Han Mao, et al.
出版: (2022) -
Two-dimensional RC/SW constrained codes: bounded weight and almost balanced weight
由: Nguyen, Tuan Thanh, et al.
出版: (2023) -
Evaluating the Gilbert-Varshamov bound for constrained systems
由: Goyal, Keshav, et al.
出版: (2024) -
On Constant-Composition Codes Over Z q
由: Luo, Y., et al.
出版: (2014) -
On Constant-Composition Codes Over Z q
由: Luo, Y., et al.
出版: (2014)