On a test for codes.
Falucskai, J. (2006)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Falucskai, J. (2006)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Östergård, Patric R.J., Weakley, William D. (2002)
Beiträge zur Algebra und Geometrie
Similarity:
Solov'eva, F.I., Tokareva, N.N. (2007)
Sibirskij Matematicheskij Zhurnal
Similarity:
Kramer, Joshua Brown (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Quistorff, Jörn (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Yuichi Kamiya, Leo Murata (2012)
Journal de Théorie des Nombres de Bordeaux
Similarity:
In the study of the -adic sum of digits function , the arithmetical function and for plays a very important role. In this paper, we firstly generalize the relation between and to a bijective relation between arithmetical functions. And as an application, we investigate some aspects of the sum of digits functions induced by binary infinite Gray codes . We can show that the difference of the sum of digits function, , is realized by an automaton. And the summation formula...
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...
Lomadze, N. (1998)
Georgian Mathematical Journal
Similarity:
C. Rodriguez-Leon, L. Garcia-Forte (2011)
Computer Science and Information Systems
Similarity:
Lóránt Farkas, Tamás Kói (2014)
Kybernetika
Similarity:
A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. The main result is the single letter characterization of the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.
Oberst, Ulrich, Dür, Arne (1983)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: