Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous applications. An important goal is obtain best possible tradeoffs between number symbols codeword algorithm must examine (the locality), amount redundancy in encoding information rate). In Hamming's classical adversarial channel model, current are dramatic...

let $a$ be a nite dimensional $k-$algebra and $r$ be a locally bounded category such that $r rightarrow r/g = a$ is a galois covering dened by the action of a torsion-free group of automorphisms of $r$. following [30], we provide criteria on the convex subcategories of a strongly simply connected category r in order to be a cycle- nite category and describe the module category of $a$. we pro...