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...
| Main Authors: | , , |
|---|---|
| מחברים אחרים: | |
| פורמט: | Journal Article |
| שפה: | English |
| יצא לאור: |
2020
|
| נושאים: | |
| גישה מקוונת: | https://hdl.handle.net/10356/144707 |