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...
Main Authors: | Nguyen, Tuan Thanh, Cai, Kui, Kiah, Han Mao, Immink, Kees A. Schouhamer, Chee, Yeow Meng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170742 |
Similar Items
-
Properties and Constructions of Constrained Codes for DNA-Based Data Storage
by: Kees A. Schouhamer Immink, et al.
Published: (2020-01-01) -
Bounds on the size and asymptotic rate of subblock-constrained codes
by: Tandon, Anshoo, et al.
Published: (2020) -
Evaluating the Gilbert-Varshamov bound for constrained systems
by: Goyal, Keshav, et al.
Published: (2024) -
Generalized sphere-packing bound for subblock-constrained codes
by: Kiah, Han Mao, et al.
Published: (2022) -
Locally-constrained de Bruijn codes: properties, enumeration, code constructions, and applications
by: Chee, Yeow Meng, et al.
Published: (2022)