Two-dimensional RC/SW constrained codes: bounded weight and almost balanced weight
In this work, we study two types of constraints on two-dimensional binary arrays. Given p\in [0,1],\in [0,1/2] , we study 1) the p -bounded constraint: a binary vector of size n is said to be p -bounded if its weight is at most pn , and 2) the -balanced constraint: a binary vector of size n is said...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/170742 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|