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: | , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/144707 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|