„Coding“

Suchergebnisse

10.000+ Treffer

• Perfect factors in the de Bruijn graph
  Paterson, Kenneth G.
• Complete variable-length “fix-free” codes
  Gillman, David ; Rivest, Ronald L.
• On quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs
  Lam, Clement ; Thiel, Larry ; Tonchev, Vladimir D.
• On symmetric incidence matrices of projective planes
  Dey, P. ; Hayden, J. L.
• Quasi-symmetric designs related to the triangular graph
  Coster, M. J. ; Haemers, Willem H.
• Subsquares in orthogonal latin squares as subspaces in affine geometries: A generalization of an equivalence of bose
  Laywine, Charles
• Kernels of nonlinear Hamming codes
  Phelps, Kevin T. ; Levan, Mike
• A powerful method for constructing difference families and optimal optical orthogonal codes
  Buratti, Marco
• Sets of type (m, n) in the affine and projective planes of order nine
  Penttila, Tim ; Royle, Gordon F.
• Geometric secret sharing schemes and their duals
  Jackson, Wen-Ai ; Martin, Keith M.
• A shift register construction of unconditionally secure authentication codes
  Johansson, Thomas
• Constructingc-ary Perfect Factors
  Mitchell, Chris J.
• On the [28, 7, 12] binary self-complementary codes and their residuals
  Dodunekov, Stefan M. ; Encheva, Silvia B. ; Kapralov, Stoyan N.
• On sequences with zero autocorrelation
  Koukouvinos, C. ; Kounias, S. ; Seberry, J. ; Yang, C. H. ; Yang, J.
• Some new 2-resolvable Steiner quadruple systems
  Teirlinck, Luc
• Two new bounds on the size of binary codes with a minimum distance of three
  Klein, Yaron ; Litsyn, Simon ; Vardy, Alexander
• Key distribution patterns using Minkowski planes
  O'Keefe, Christine M.
• On perfectt-shift codes in abelian groups
  Munemasa, Akihiro
• Authentication codes for nontrusting parties obtained from rank metric codes
  Johansson, Thomas
• A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters
  Brouwer, A. E. ; Tolhuizen, L. M. G. M.