The main objects of Coding theory are metric vector or matrix spaces. Subsets of spaces are
known as codes. The main problem is constructing codes of given pairwise distance and …

This paper investigates the problem of correcting multiple criss-cross insertions and
deletions in arrays. More precisely, we study the unique recovery of arrays affected by-criss …

In this paper, list decoding of crisscross errors in arrays over finite fields is considered. For
this purpose, the so-called cover metric is used, where the cover of a matrix is a set of rows …

This paper investigates the problem of correcting multiple criss-cross deletions in arrays.
More precisely, we study the unique recovery of n*n arrays affected by any combination of …

List decoding of crisscross errors in arrays over finite fields is considered. A Johnson-like
upper bound on the maximum list size in the cover metric is derived, showing that the list of …

This study investigates codes in the term‐rank metric. These codes can be used to correct
crisscross errors in a () matrix. These errors can be found in memory chip arrays, in magnetic …

This paper studies the problem of constructing codes correcting deletions in arrays. Under
this model, it is assumed that an array can experience deletions of rows and columns. These …

In this paper, the data storage process is considered from the point of view of coding theory.
A hybrid of data storage systems and error-correcting code (ECC) is a promising technology …

This paper investigates coding for crisscross errors in the term-rank metric. The term-rank of
a matrix equals to minimal number of row and columns that collectively contain all of non …

Many technologies require substantial research and development to facilitate the
emergence of mature and generic software defined radio architectures, as will be evident …