Parvfect
commented
8 months ago (a,b,c,d) → (ab) → (aaba)
4c2 symbols → R = 4 (can we have more reads than bases?)
Simple Decoder → use a set to remove repeated elements, and then perform belief propogation decoding
N Motifs
NcK Symbols (from the Motifs)
Coding over the Symbols (3,6 Non Binary LDPC code with R=0.5, L_c = 2000)
R Motifs as output for each symbol - K → R length formed out of any combination of any or all parts of the symbol by random (will be dependant on that procedure of scrambling)
Needs to be traced back to the specific $(NcK)_i$ symbol using a designed local optimal decoder