Poids et équivalence des codes linéaires
Polynômes des poids de certains codes et fonctions thêta de certains réseaux
Quadratic forms, fibre products and some plane curves with many points
Quasi-questionnaires, codes and Huffman's length
Quelques constructions et algorithmes relatifs aux sous-monoïdes d'un monoïde libre.
Recobriments i grafs distància-regulars.
Uno de los aspectos claves en las telecomunicaciones está relacionado con el uso de los códigos correctores de errores para la transmisión de información. Actualmente se utiliza una clase muy simple de códigos; la implementación física de un código corrector de errores es complicada y costosa. En el campo de la Informática Teórica se intenta abordar el problema de los códigos correctores de errores desde diferentes ángulos. Uno de ellos es el de la Combinatoria Algebraica y, en particular, los grafos...
Reconstruction theorems for centered functions and perfect codes.
Recursively differentiable quasigroups and complete recursive codes
Criteria of recursive differentiability of quasigroups are given. Complete recursive codes which attains the Joshibound are constructed using recursively differentiable -ary quasigroups.
Reed-Muller codes and supersingular curves. I
Regular prefix-codes and right power-bounded languages.
Réseaux quaternioniens et invariant de Venkov.
Residual representation of algebraic-geometric codes.
Restitution des coefficients d'ondelettes des signaux filtrés
Restrictions and generalizations on comma-free codes.
Soft Decision Decoding of Binary Linear Block Codes Using the Bfgs-Method
Some aspects of Hankel matrices in coding theory and combinatorics.
Some functionals on sets of stationary codes
Some maximum multigraphs and edge/vertex distance colourings
Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree Δ(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found.
Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code
* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.MDS [8,4,5] codes over a field with 64 elements are constructed. All such codes which are self-dual under a Hermitian type inner product are classified. The connection between these codes and a putative binary self- dual [72,36,16] code is considered.
Some new lower bounds for ternary covering codes.