2013/10/31 by James R. Wootton, James Wootton · 26 citations
Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Code (set theory) #Coding theory and cryptography #Decoding methods #Encoding (memory) #Error Correcting Code Techniques #Planar #Simple (philosophy) #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.3390/e17041946
published in Entropy 17(4), 1946-1957 (Multidisciplinary Digital Publishing Institute) · v3: Corrected error and added data for correlated errors. v4: Added data for improved version of decoder. This is the published version
openalex publication_date 2015/04/01 · arxiv created 2015/04/09 · arxiv updated 2015/04/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
Here we study an efficient algorithm for decoding topological codes. It is a simple form of HDRG decoder, which could be straightforwardly generalized to complex decoding problems. Specific results are obtained for the planar code with both i.i.d. and spatially correlated errors. The method is shown to compare well with existing ones, despite its simplicity.