Displaying similar documents to “On a complete set of operations for factorizing codes”

Completing codes

A. Restivo, S. Salemi, T. Sportelli (1989)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On Multiple Deletion Codes

Landjev, Ivan, Haralambiev, Kristiyan (2007)

Serdica Journal of Computing

Similarity:

In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...

Divisible Codes - A Survey

Ward, Harold (2001)

Serdica Mathematical Journal

Similarity:

This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.

On z -submonoids and z -codes

M. Madonia, S. Salemi, T. Sportelli (1991)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On some Optimal (n,t,1,2) and (n,t,1,3) Super Imposed Codes

Manev, Mladen (2009)

Serdica Journal of Computing

Similarity:

Partially supported by the Technical University of Gabrovo under Grant C-801/2008 One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values...

Ternary constant weight codes.

Östergård, Patric R.J., Svanström, Mattias (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity: