• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 19 matches

• 2011
• 
  K. T. Arasu:
  Sequences and arrays with desirable correlation properties. Information Security, Coding Theory and Related Combinatorics 2011: 136-171
• 
  Charles J. Colbourn:
  Covering arrays and hash families. Information Security, Coding Theory and Related Combinatorics 2011: 99-135
• 
  Dean Crnkovic, Vedrana Mikulic Crnkovic, Bernardo Gabriel Rodrigues:
  Designs, strongly regular graphs and codes constructed from some primitive groups. Information Security, Coding Theory and Related Combinatorics 2011: 231-252
• 
  Ryoh Fuji-Hara, Ying Miao:
  Multi-structured designs and their applications. Information Security, Coding Theory and Related Combinatorics 2011: 326-362
• 
  Willem H. Haemers:
  Matrices for graphs, designs and codes. Information Security, Coding Theory and Related Combinatorics 2011: 253-277
• 
  Ivana Ilic, Spyros S. Magliveras:
  Crypto applications of combinatorial group theory. Information Security, Coding Theory and Related Combinatorics 2011: 1-16
• 
  Masakazu Jimbo, Keisuke Shiromoto:
  Quantum jump codes and related combinatorial designs. Information Security, Coding Theory and Related Combinatorics 2011: 285-311
• 
  J. D. Key:
  Permutation decoding for codes from designs, finite geometries and graphs. Information Security, Coding Theory and Related Combinatorics 2011: 172-201
• 
  Hadi Kharaghani:
  Unbiased Hadamard matrices and bases. Information Security, Coding Theory and Related Combinatorics 2011: 312-325
• 
  Andreas Klein, Leo Storme:
  Applications of finite geometry in coding theory and cryptography. Information Security, Coding Theory and Related Combinatorics 2011: 38-58
• 
  Clement W. H. Lam:
  Finding error-correcting codes using computers. Information Security, Coding Theory and Related Combinatorics 2011: 278-284
• 
  Spyros S. Magliveras, Tran van Trung, Wandi Wei:
  On Jacobsthal Binary Sequences. Information Security, Coding Theory and Related Combinatorics 2011: 27-37
• 
  Kenneth Matheis, Spyros S. Magliveras:
  Generating rooted trees of m nodes uniformly at random. Information Security, Coding Theory and Related Combinatorics 2011: 17-26
• 
  Jamshid Moori:
  Finite Groups, Designs and Codes. Information Security, Coding Theory and Related Combinatorics 2011: 202-230
• 
  Tony Shaska, Lubjana Beshaj:
  The arithmetic of genus two curves. Information Security, Coding Theory and Related Combinatorics 2011: 59-98
• 
  Mohan S. Shrikhande, Tariq A. Alraqad:
  Recent results on families of symmetric designs and non-embeddable quasi-residual designs. Information Security, Coding Theory and Related Combinatorics 2011: 363-403
• 
  Vladimir D. Tonchev:
  Finite geometry designs, codes, and Hamada's conjecture. Information Security, Coding Theory and Related Combinatorics 2011: 437-448
• 
  Richard M. Wilson:
  Codes and modules associated with designs and t-uniform hypergraphs. Information Security, Coding Theory and Related Combinatorics 2011: 404-436
• 
  Dean Crnkovic, Vladimir D. Tonchev:
  Information Security, Coding Theory and Related Combinatorics. NATO Science for Peace and Security Series - D: Information and Communication Security 29, IOS Press 2011, ISBN 978-1-60750-662-1 [contents]