Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes

06/14/2019
by   Yeow Meng Chee, et al.
0

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.

READ FULL TEXT
research
12/21/2018

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs

In this paper, we construct several classes of maximum distance separabl...
research
02/13/2023

Efficient Systematic Deletions/Insertions of 0's Error Control Codes and the L_1 Metric (Extended version)

This paper gives some theory and efficient design of binary block system...
research
07/16/2022

Hulls of special typed linear codes and constructions of new EAQECCs

In this paper, we study Euclidean and Hermitian hulls of generalized Ree...
research
11/08/2018

Codes correcting restricted errors

We study the largest possible length B of (B-1)-dimensional linear codes...
research
05/06/2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications

The de Bruijn graph, its sequences, and their various generalizations, h...
research
01/06/2022

Codes from symmetric polynomials

We define and study a class of Reed-Muller type error-correcting codes o...
research
02/04/2021

Minimizing the alphabet size in codes with restricted error sets

This paper focuses on error-correcting codes that can handle a predefine...

Please sign up or login with your details

Forgot password? Click here to reset