### On codes with given minimum distance and covering radius.

Quistorff, Jörn (2001)

Beiträge zur Algebra und Geometrie

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Quistorff, Jörn (2001)

Beiträge zur Algebra und Geometrie

Similarity:

Solov&#039;eva, F.I., Tokareva, N.N. (2007)

Sibirskij Matematicheskij Zhurnal

Similarity:

Lukáš Ďurfina, Dušan Kolář (2012)

Kybernetika

Similarity:

Obfuscation is a process that changes the code, but without any change to semantics. This process can be done on two levels. On the binary code level, where the instructions or control flow are modified, or on the source code level, where we can change only a structure of code to make it harder to read or we can make adjustments to reduce chance of successful reverse engineering.

Dass, Bal Kishan, Das, Pankaj Kumar (2009)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

Alain Couvreur (2011)

Journal de Théorie des Nombres de Bordeaux

Similarity:

The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this description is less trivial, it can be regarded as a natural extension to surfaces of the result asserting that the dual of a functional code ${C}_{L}(D,G)$ on a curve is the differential code ${C}_{\Omega}(D,G)$ . We study the parameters of such codes and state a lower bound for their minimum distance. Using this bound, one can study...

Kéri, Gerzson, Östergård, Patric R.J. (2006)

Journal of Integer Sequences [electronic only]

Similarity:

Falucskai, J. (2006)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity:

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

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

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

The Electronic Journal of Combinatorics [electronic only]

Similarity: