Optimal <inline-formula> <tex-math notation="LaTeX">q </tex-math> </inline-formula>-Ary Error Correcting/All Unidirectional Error Detecting Codes

DOI10.1109/TIT.2018.2800055MaRDI QIDQ4682879zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Xian De Zhang

Publication date 19 September 2018

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.06066

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Linear codes (general theory) (94B05)

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$.

Cited in

(4)

• Algorithms for q-ary error-correcting codes with limited magnitude and feedback
• scientific article; zbMATH DE number 4123677 (Why is no real title available?)
• Bounds and constructions for codes correcting unidirectional errors
• On t-error correcting/all unidirectional error detecting codes

This page was built for publication: Optimal <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Error Correcting/All Unidirectional Error Detecting Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682879)