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...
| Autores principales: | , , |
|---|---|
| Otros Autores: | |
| Formato: | Journal Article |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://hdl.handle.net/10356/144707 |