Displaying similar documents to “On codes with given minimum distance and covering radius.”

C source code obfuscator

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.

On a test for codes.

Falucskai, J. (2006)

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

Similarity:

Minimal Codewords in Linear Codes

Borissov, Yuri, Manev, Nickolai (2004)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 94B05, 94B15. Cyclic binary codes C of block length n = 2^m − 1 and generator polynomial g(x) = m1(x)m2^s+1(x), (s, m) = 1, are considered. The cardinalities of the sets of minimal codewords of weights 10 and 11 in codes C and of weight 12 in their extended codes ^C are determined. The weight distributions of minimal codewords in the binary Reed-Muller codes RM (3, 6) and RM (3, 7) are determined. The applied method enables codes...

Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes

Yuichi Kamiya, Leo Murata (2012)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In the study of the 2 -adic sum of digits function S 2 ( n ) , the arithmetical function u ( 0 ) = 0 and u ( n ) = ( - 1 ) n - 1 for n ≥ 1 plays a very important role. In this paper, we firstly generalize the relation between S 2 ( n ) and u ( n ) to a bijective relation between arithmetical functions. And as an application, we investigate some aspects of the sum of digits functions S 𝒢 ( n ) induced by binary infinite Gray codes 𝒢 . We can show that the difference of the sum of digits function, S 𝒢 ( n ) - S 𝒢 ( n - 1 ) , is realized by an automaton. And the summation formula...

A topological version of Bertini's theorem

Artur Piękosz (1995)

Annales Polonici Mathematici

Similarity:

We give a topological version of a Bertini type theorem due to Abhyankar. A new definition of a branched covering is given. If the restriction π V : V → Y of the natural projection π: Y × Z → Y to a closed set V ⊂ Y × Z is a branched covering then, under certain assumptions, we can obtain generators of the fundamental group π₁((Y×Z).

On the disc theorem

Cabiria Andreian Cazacu (1991)

Annales Polonici Mathematici

Similarity:

Ahlfors' disc theorem for Riemann covering surfaces is extended to normally exhaustible Klein coverings.