Displaying similar documents to “Minimal Codewords in Linear Codes”

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:

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