  SC-LDPC codes with sub-block locality can be decoded locally at the level of
sub-blocks that are much smaller than the full code block, thus providing fast
access to the coded information. The same code can also be decoded globally
using the entire code block, for increased data reliability. In this paper, we
pursue the analysis and design of such codes from both finite-length and
asymptotic lenses. This mixed approach has rarely been applied in designing SC
codes, but it is beneficial for optimizing code graphs for local and global
performance simultaneously. Our proposed framework consists of two steps: 1)
designing the local code for both threshold and cycle counts, and 2) designing
the coupling of local codes for best cycle count in the global design.
