A commontechniquein describingthesecodesreliesontheirgraphtheoreticrepresentationdueto Tanner[16].Inthispaper,we examine ve classesof binarylinearerror ...
(PDF) A graph-based formalism for surface codes and twists
www.researchgate.net › publication › 38...
Jul 11, 2024 · Twist defects in surface codes can be used to encode more logical qubits, improve the code rate, and implement logical gates.
Jan 30, 2023 · Let $H$ be a fixed graph with an even (positive) number of edges, and let $D_H(n)$ denote the maximum possible cardinality of a family of graphs ...
I. Djurdjevic, S. Lin, and K. , Graph-theoretic construction of low-density parity-check codes, IEEE Communications Letters, vol.7, issue.4, pp.171-173, 2003.
People also ask
What does Q mean in graph theory?
What do you mean by graph theoretic?
We propose simple heuristic algorithms permuting the code positions of a linear block code to reduce the total number of nodes of the minimal trellis. Obtained ...
5 days ago · Further variants of DP-LDPC codes have been introduced to improve the performance [155, 156, 157] . A graph theoretic construction method is ...
Mar 3, 2015 · The results presented in this thesis are from the fields of finite geometry and graph theory, mainly from their intersection.
(DOI: 10.1007/BF01222398) The square-root bound for quadratic-residue codes of lengthn≡1 (mod 4) is improved in several cases by graph-theoretic means.
Dec 6, 2019 · Nonbinary codes, correcting single deletion or insertion (Corresp.) ... Estimating the size of correcting codes using extremal graph problems; pp.
There have been significant advances towards this goal in the last couple of decades, with the emergence of turbo codes, sparse- graph codes, and polar codes.