VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/1746
Title: | Capacity of locally balanced and run-length limited constrained codes | Authors: | Phan Cong Huy | Keywords: | Locally balanced;Run-length limited;Capacity;Constrained binary code;Largest eigenvalue;De Bruijn graph | Issue Date: | 2023 | Abstract: | DNA storage is becoming a promising alternative data storage to electronic devices. In order to minimise the probability of errors occur during the process of storing and retrieving data into and from DNA storage, we have to use a Coding Scheme that encodes binary source codes to locally balanced and run length limited constrained binary codes. In short, the set of such codes is called LB and RLL coding system. In fact, there are numerous LB (locally-balanced) and RLL (run-length limited) coding systems as the conditions for locally balanced and runlength limited can be altered. In order to determine whether one LB and RLL coding system is potentially better than others in term of storage efficiency and data integrity, we have to calculate the capacities of these systems. In this thesis, we are going to show that capacity of any LB and RLL coding system is equal to the largest eigenvalue of the adjacency matrix of a De Bruijn graph presenting a subset of codes of LB and RLL coding system. |
URI(1): | https://epub.vgu.edu.vn/handle/dlibvgu/1746 | Rights: | Attribution-ShareAlike 3.0 United States |
Appears in Collections: | Computer Science (CS) |
Files in This Item:
File | Description | Size | Format | Existing users please Login |
---|---|---|---|---|
Capacity of locally balanced and run-length limited constrained codes.pdf | 1.28 MB | Adobe PDF |
This item is licensed under a Creative Commons License