Year: 2019
Type: preprint
Abstract: Codes that can correct up to $t$ symmetric errors and detect all unidirectional errors, known as $t$-EC-AUED codes, are studied in this paper. Given positive integers $q$, $a$ and $t$, let $n_q(a,t+1)$ denote the length of the shortest $q$-ary $t$-EC-AUED code of size $a$. We introduce combinatorial constructions for $q$-ary $t$-EC-AUED codes via one-factorizations of complete graphs, and concatenation of MDS codes and codes from resolvable set systems. Consequently, we determine the exact values of $n_q(a,t+1)$ for several new infinite families of $q,a$ and $t$.
Source: arXiv (Cornell University)
Authors: Chee, Yeow Meng, Zhang, Xiande
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G2946405534, k-radius序列及相关组合问题的研究
OpenAlex ID: W2949549213