The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “C source code obfuscator”

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

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